Fully integrated machinable profile based parametric solid modeler

ABSTRACT

A solid modeler is provided which is specifically tailored for the material removal process associated with milling procedure. The solid modeler permits a part to be designed using only machinable profiles thereby constraining the designer to real world machinable operations. The method utilized by this solid modeler allows design manipulation of the edges and curves of a very general feature profile, thereby representing the milling process with the same degree of flexibility that the actual milling process has, and provides a means to create and store for use in the generation of other parts any combination of 2D and 3D features.

BACKGROUND OF THE INVENTION

a) Field of the Invention

This invention provides a solid modeler specifically tailored for the material removal process associated with milling procedure, and that permits a part to be designed using only machinable profiles.

b) Description of the Prior Art

Object modeling is a tool for a designer to display and verify his conceptual design on a computer screen. Earlier methods of object modeling were based on designing a pan with 2D drawings. The designer provided the machining information using manufacturing symbols, tolerances, and dimensions. The completed design was turned over to a process planner. He reviewed 2D engineering drawings and integrated them to arrive at, in the case of milling, material removal information, which was then converted into a set of machining operations. This set of machining operations was then used to machine the part.

With increased computing power available, methods were introduced whereby one could model a part as a 3D shape. The process of representing a 3D shape by relationships that can be manipulated using a computer is called geometric modeling. A model of a part developed using a geometric modeling method is called a geometric model, sometimes referred to as a CAD model. Geometric modeling has progressed from wire frame to surface modeling to solid modeling schemes. Initial modelers represented and stored an object by its vertices and edges. Such a model is called a wire frame model. A wire frame model is used for computer display. However, a wire frame model is an ambiguous model and, therefore, the surface area and volume of the part cannot be computed. Another type of 3D modeler, called a surface modeler, maintains the surfaces of an object. Each surface in a surface model is a free form surface that is represented by many bicubic patches. Each bicubic patch is defined by cubic equations of two parameters, which vary from 0 to 1 and which define all points on the surface. The surface modeler is suitable for object visualization and aesthetic designs of objects like car bodies and airplane fuselages. However, a surface model cannot be used to determine the volume of an object.

Solid modelers overcame the limitations of wire frame and surface modelers, and can now be used to determine both the surface area and the volume. A solid model is represented by quadric primitives or entities. A quadric primitive is the space bounded by a quadric surface, which is a surface described by a second order polynomial. Examples of quadric primitives are cylinders, blocks, spheres, cones and torii. A part is modeled by applying boolean operations on these quadric primitives. Solid modeling has gained wide acceptance because it provides an unambiguous model of an object. However, because of the small set of primitives currently available it is very difficult to use the present modelers to represent any but the simplest material removal operations. Consequently, machining information is not automatically available from a solid model; however, it can be extracted from it. Machined features, that is, the volume removed by a machining operation, are either manually or automatically extracted after the geometry has been completely defined. A process planner is then often used to decide the tool path for machining each individual feature. Based on this machining information the NC code is generated for input to an NC machine tool for machining the part. The difficulty with this method is that the machining information has to be extracted from the solid model after it is formed, which is a computationally difficult task.

Another approach is to use a method called feature based design in which a part is created using a set of functional volumes called features. In a feature based design system the features, which are sometimes called form features, are the regions of importance from a designer's point of view, and satisfy a functional role rather than satisfying any machining process requirement. In general, a feature may not be machinable. For example, consider a thin wall ridge existing between two parallel slots. The thin wall between the slots is a form feature, whereas the slots are the machined features. The feature based design method develops a model with the form features and stores the features in a database. This feature database is utilized by an expert process to establish the process plans, and eliminates having to extract the material removal information from a general purpose solid model. However, a feature modeler must contain a very large library of differently shaped volumes to be of any practical use. Furthermore, the feature based design method is not constrained by any limitation inherent in the machining process itself.

As will be discussed below there is a need for a method that: (i) allows an interactive development of a solid model using machinable features, (ii) can simultaneously store the appropriate machining information, and (iii) can constrain the part creation by incorporating the limits of the machining operations as part of the design process. This dissertation describes the development of a solid modeler that meets these criteria A process of interactively building a geometric model is implemented by sequentially applying a fundamental machinable entity for milling (FMEM) to a solid rectangular prismatic part Each FMEM is a 3D design entity that is natural to the machining process, thereby automatically constraining the design to an object that is manufacturable by milling. Each FMEM represents the material removed after a milling operation has been implemented. Thus, the need for extracting this information at a later stage is eliminated, and the final part geometry is obtained in a manner that has been fully integrated with the milling process.

Solid modeling has been linked with manufacturing in one of two ways: either by extracting machinable feature information from the part model or by developing the model using features and then using these features to determine a manufacturing process plan. An overview of the research efforts in solid modeling, feature extraction and feature based design methods will be provided below. In addition, some of the methods of integrating solid modeling with CAM are discussed in detail.

A successful scheme for solid modeling must be (1) complete, unambiguous, and unique, (2) appropriate to the class of engineering components, and (3) practical to use with existing computers (Requicha, 1980).

There are six unambiguous schemes available for representing rigid solids (Meagher, 1981). These schemes are (i) Primitive Instancing, (ii) Spatial Enumeration, (iii) Cell Decomposition, (iv) Constructive Solid Geometry (CSG), (v) Sweep Representation, and (vi) Boundary Representation (B-Rep).

Among these schemes Constructive Solid Geometry (CSG) and Boundary Representation (B-Rep), or a hybrid of them, are used in current solid modelers. In a CSG scheme, the objects are represented as collections of primitive solids that are connected via boolean operations. In B-Rep, objects are represented by their enclosing surfaces. Topology of a B-Rep model is given by the connectivity of faces, edges and vertices. In both schemes to date, only quadric surfaces (planes, cylinders, cones, spheres and torii) are considered (Pratt, 1989). Edges are obtained by the intersection between these surfaces. These edges are either straight lines, conic curves (exact representation possible) or space curves (approximated). In the B-Rep scheme each face is divided into planar facets or patches. However, some systems define each facet as a ring of four connected edges (Pratt, 1989).

Braid and Lang (1973) at Cambridge proposed the very first solid modeling system, which was based on a B -Rep scheme. Their solid modeler, which is called BUILD, represents an object as a solid model and stores the information about the object's vertices, edges and faces. The topological information about the model is derived from a table of faces, edges and vertices. A solid is then formed by the region bounded by its faces.

Another solid modeler called TIPS was developed at Hokkaido University by Okino, Kakazu & Kubo (1973) using CSG. TIPS stores the object as a collection of primitive solids like blocks and cylinders. However, the solid primitives are represented by half-spaces in the CSG tree. Half-spaces are infinite surfaces that divide a 3D space into two regions. For example, a cube is bounded by six planar surfaces. TIPS has been improved upon and is now available as the CAM-I solid modeler (CAM-International, 1981). After TIPS and BUILD were introduced, a debate over the advantages of one scheme over the other ensued.

The TIPS-BUILD debate ended when the PADL-1 (Part and Assembly Description Language) (Voelcker & Requicha, 1977 and Voelcker & Requicha, 1981) solid modeler was introduced. PADL-1, an experimental solid modeler, was based on CSG. In PADL-1 an object is stored as a binary CSG tree whose termination nodes are solid primitives rather than half-spaces. PADL-1 also provided the option of generating the B-Rep tree from a CSG tree. In PADL-1 only bricks and cylinders were included. In the next version of the solid modeler, called PADL-2 (Brown, 1982), a solid modeler that had commercial applicability was developed. PADL-2 was also based on CSG, but the number of primitives available was extended to wedges, spheres, cones and torii. These primitives, when combined through boolean operations, can model an object. GMSolid (Boyse & Gilchrist, 1982), a CSG solid modeler developed at General Motors for internal use, adopted the concepts developed by the PADL-2 project.

Baumgart (1975) introduced the "winged-edge structure" representation of solids in his solid modeler called GEOMED. The representation consists of three elements: an edge, a face and a vertex Baumgart's winged-edge structure helps to determine the topological relationships of faces, edges and vertices in a B-Rep tree. Many solid modelers (Braid, 1979; Chiyokura, 1988; Eastman & Henrion, 1977; Hosaka, Kimura & Kakishita, 1974; Veenman, 1979) were later introduced based on the winged-edge boundary representation of an object. Baumgart's representation was adopted in the next version of the BUILD software (BUILD-2) (Braid, 1979). However, Braid extended the winged-edge method to represent solids with holes. In BUILD-2 a face is represented by many child-loops within a parent-loop. A parent-loop is a closed contour of connected edges that bounds a face on a surface, whereas a child-loop is the contour of edges bounding a hole on the same surface. Parent and child loops exist on the same surface and, therefore, can be represented by the same surface equation. Another solid modeler that is similar to BUILD-2 is DESIGNBASE (Chiyokura, 1988). DESIGNBASE uses B-Rep as a representation scheme for the solid modeler and implements the use of "local operations", in addition to the known boolean operations. The local operations help the designer to modify the part design quickly and conveniently.

Other solid modeling systems based on B-Rep emerged in the early 1970s. These include: (1) ROMULUS (Veenman, 1979), which is a solid modeler based on the concepts developed by BUILD-2 and GEOMED; (2) GEOMAP (Hosaka et al, 1974) from the University of Tokyo; (3) COMPAC (Spur & Gausmieier, 1975) from the Technical University of Berlin; and (4) GLIDE (Eastman & Henrion, 1977) from Carnegie Mellon University.

There are now many solid modelers available for commercial use (Johnson, 1986; Dartech Inc, 1984). Most of them support not only CSG and B-Rep representations, but also the sweeping technique. Among them are: (1) CATIA from Dassault Systems; (2) EUCLID from Matra Datavision; (3) GEOMOD from Structural Dynamic Research Corporation; (4) MEDUSA from Cambridge Interactive Systems Ltd; and (5) ANVIL-5000 from MCS Inc.

There are several PC based CAD modelers (Hart, 1986 and Dartech Inc, 1984) that have started implementing solid modeling techniques. Among these PC based CAD tools are CADKEY, ANVIL-1000 and AUTOCAD.

Several researchers have attempted to link a solid model to a process planner. They have used two basic approaches: (i) recognize and extract the material removal information from the part geometry; and (ii) develop the part geometry itself using special shaped volumes. These volumes are then used to extract the features and generate the process plan.

In the first method a part model is developed in a solid modeler system, usually using B-Rep. Features are then extracted from the solid model of the part. This is done either manually or automatically. These machining features are then used in a process planner, and NC code is generated. This method allows the designer to model his part in any way, and is not limited by manufacturing restrictions. Consequently, it is possible to create a part that is not manufacturable. Another drawback of this method is that the material removal information is extracted from the solid model and, therefore, the original part geometry is lost.

In the second method a part geometry is based on form features themselves. As mentioned previously, an example of the form feature is a ridge that is formed by two parallel slots machined in proximity. A designer considers the ridge a feature because the integrity of the designed part depends on the strength of the ridge. A form feature is a region of importance from the designer's point of view, but may not be a machinable feature. A model is assembled by these form features. Machinable features are then manually identified (as in XCUT [Hummel & Brooks, 1986 and Hummel & Brooks, 1987]) or automatically extracted from the form feature database (as in QTC [Chang, Anderson & Mitchell, 1989]). Machined features are then processed by a process planner, and NC code is generated. A feature model is not used for part display and a separate solid modeler is used for displaying the part geometry. This method provides some integration of CAD and CAM, but the part geometry is comprised of volumes of too many shapes, sizes and forms (Ishii & Miller, 1992). Secondly, no consideration is given to the machinability of a feature. A design is based on standard features like slots, holes, pockets and grooves. A machining process is capable of removing volumes that are more complicated than these simple features. Using only these features in the design process limits the manufacturing to only that class of parts that can be made with these operations.

Among the researchers whose work is related to feature extraction from a solid model are Grayer (1977), Woo (1977), Henderson (1984), Kumar, Anand and Kirk (1988), Kumar (1988) and Fields and Anderson (1993). Their contributions have been to develop methods that automatically extract feature information from a solid model. The works of Luby, Dixon and Simmons (1986), Hummel and Brooks (1986), Kramer and Jun (1987), Shah et al. (1988), Chang et al. (1989) and Xue and Dong (1993) have made contributions to feature based modeling. Karinthi and Nau (1989) have provided a review of the work of many others who have contributed to feature based design.

Grayer (1977) describes a procedure that generates a tool path directly from the CAD model. His work is limited to 21/2-D parts. Such a machined part consists of fixed depth laminae plus a representation of the outside boundary of the finished part. The shapes of the laminae are precisely the cross section of the object at different heights. In an object, its cross section at any height may be determined by finding the intersection of each vertical face with the sectioning plane, and joining the resulting line segments to form contours. Holes can be placed within their respective outer boundaries by a 2-D comparison. Each lamina is represented by one or more two-dimensional contours giving the shape of the boundary and that of any islands projecting through the lamina, forming holes in the region to be removed. In addition, the thickness and vertical position of the lamina must be stored, together with some scheme to indicate the order of the machining operations.

Woo (1977) investigated the role of solids and negative solids in the creation of cavities. A cavity corresponds to the result of adding or removing a volume from other volumes. The essential idea of deriving cavities from volumetric designs is done by computing the various ways in which solids are shaped by other solids via certain addition and subtraction operations.

Henderson (1984) proposed that cavities in a part can be considered features. These features can be extracted from a part after the model is developed, and has suggested a detailed algorithm to extract them. Each feature can then be put in a form that is suitable for numerical code generation. Henderson has provided a method of implementing this algorithm for machining the parts.

Kumar (1988) developed a feature extractor using the IGES (Initial Graphics Exchange Specifications) for input part geometry and the part model format (PMF) for output. Kumar used the wire frame description of the part geometry and dealt with slots, pockets, holes, bosses and ridges.

Fields and Anderson (1993) described an algorithm to extract machinable features from either a feature based model or a B-rep model for the 21/2-D cavity features. They have pointed out that the set of features available in a feature based model do not correspond to the process oriented machining features. In order to bridge this gap they have introduced a hybrid feature that accounts for the additional stock material to be removed.

Kramer and Jun (1987) have come up with a part editor for one-sided, 21/2-D parts. The part can be made by specifying machinable features from their library of machinable features using the part editor. The part thus developed is displayed and then used to generate the process plans and the NC code.

Xue and Dong (1993) described a method for concurrent design and manufacturing. Their design is comprised of three distinct perspectives: functional, manufacturing and geometry. In this knowledge-based system design and manufacturing features are mapped to geometry features for displaying the geometry. The design features are maintained in a design database, whereas the manufacturing features are kept in a database that is based on group technology.

A few researchers have considered feature interactions. Ide (1987) considered feature interaction on a limited scale. In his work, he developed a feature based design system using the PADL-2 solid modeler. The purpose of his work was to integrate PADL-2 with SIPS, an automatic process planner, which can handle planar surfaces, slots, pockets, holes and countersunk holes. Hayes (1987) described her system called MACHINIST This system is a rule-based system that uses feature interactions to determine precedence relations among features. Karinthi and Nau (1989) have pointed out that there is a need for a "feature algebra" for solving feature interaction problems, rather than using the rule based expert systems.

Hummel and Brooks (1986, 1987) proposed a feature based process planner called XCUT, which is based on a commercial solid modeler ROMULUS, a user interface for interactively identifying and extracting features from the solid modeler, a feature based database in which features are represented symbolically in an object oriented programming language called FLAVOR, and an expert process planner. The process planner interacts with the feature database and processes the features to generate the manufacturing information. The XCUT system appears to be the most advanced to date, although it still does not provide full integration of CAD and CAM because the features must be identified manually.

The Quick turnaround cell (Chang et al., 1989) is an integrated design, manufacturing and inspection system. It is a hybrid of the feature extraction and feature based design approaches. It consists of four modules: a feature based design system, a process planner, a direct numerical control programming module, and an inspection module based on vision.

The design module maintains the part definition in two representations: a feature based model and a boundary representation model. The feature based model is used for process planning and the B-Rep model is used for displaying the part geometry using an external solid modeler. A list of features is maintained in a part file used for process planning. The design module allows input of features such as a hole, slot and pocket. Tolerances can be attached to each feature. The model is constructed by features using "geometric handlers", which are characteristic geometric elements of features. For example, point and line specifications are geometric handlers. Vertices of a rectangular workpiece are its handlers, whereas line handlers are used to represent feature entities such as feature depth and length. Two features are related to each other in the model by their reference handlers, that is, by reference points on one of their faces. QTC seems to be a step towards automating the part production; however, the integration of CAD and CAM still lacks perfection as it maintains two separate models: a model for process planning and a display model. Furthermore, the feature model is based on functional requirements rather than the machining requirements.

Prior process oriented feature based design approaches will now be discussed. Luby et al. (1986) developed a methodology for designing castings using macro-features and co-features. The macro-features are the primitive volumes and the co-features are the extensions or attachments to them. They considered U-channels, I-brackets, and slabs as the macro-features. The co-features are holes, bosses and ribs. Macro and co-features are treated as primitives and the part geometry is constructed using these primitives. They then developed a menu driven system to design castings.

Another effort in the area of design for manufacturing has been made by Roller and Gschwind (1989). They proposed a CAD system that creates a 3D geometry by applying geometric transformations (translations and rotations) to a tool profile curve. This system works on manufacturing commands such as mill, extrude, drill, turn and lift. A user first designs a tool profile and then uses the manufacturing commands to design a part.

Recently Delbressin & van der Wolf (1990) and Delbressin & Hijink (1991) showed that the designed part can be built by "delta volumes" or "manufacturable objects". Each manufacturable object is the result of the intersection of a solid object with "tools cutting parts volumes". A "tools cutting parts volume" is a function of the tools used and their movement with respect to the workpiece. They showed that only a limited number of manufacturable objects are available for a machining process. The inverse transformation between "delta volume" and "tools cutting parts volume" is a one to many mapping. This allows more than one option for the tools to approach or withdraw from the solid object in order to create the desired "delta volume". They suggest that a manufacturing oriented design method may be developed by attaching the withdraw/approach direction vector and tolerances to the manufacturable objects.

With limited success, many efforts have been made to integrate machining with the design process, but these efforts have still fallen short. Feature extraction methods are used to extract the features from a part geometry and then to create the process plan to obtain these features via NC part programming commands. When features are extracted, however, the total part geometry is lost.

Feature based design systems are favored because they provide the best CAD/CAM integration. However, feature based design methodologies emphasize the functional design, rather than the direct linking of the design with the machining process. Typically, only simple features are considered and the very important aspect of feature interaction has not been treated. Often simple feature approaches result in part geometries that are comprised of too many differently shaped volumes. Features like holes, slots and pockets do not completely define all the volumes that could be created by the machining processes. The "delta volume" approach begins to integrate CAD and CAM, but it too results in a part geometry with too many differently shaped volumes.

SUMMARY OF THE INVENTION

In order to eliminate many of the limitations of the previous results, it is the objective of this research to develop a solid modeler specifically tailored for the material removal process associated with milling. The computer tool that will be described

is based on designing a part by sculpting the stock block,

directly integrates a geometric modeler with the machining process,

results in a fast, powerful and fully integrated solid modeler, which is constrained by real world machining operations,

is comprised of a single material removal entity, where the machinable feature information is contained within a uniform and compact geometric database,

is capable of retaining the complete analytical specifications of each machinable feature, and

makes the geometric results of all machining operations immediately available to the designer at each stage within the design process.

It will be shown that this modeler makes a significant departure and improvement over current solid modelers, and that it

allows design manipulation of the edges and curves of a very general feature profile, thereby representing the milling process with the same degree of flexibility that the actual milling process has,

allows the determination of multi-feature intersections on a common surface,

allows feature intersections on two orthogonal surfaces, and

provides a means to create and store for use in the generation of other parts any combination of 2D and 3D features.

In addition, this modeler provides the design engineer with the heretofore unavailable and useful capabilities of

simulating directly the application of milling operations to a rectangular prism,

designing a geometric shape that can be created by either a cavity, an island or a combination of both, and

designing with either common milling features, such as holes, slots, gaskets, pockets and islands, or 2D and 3D features resulting from the intersections of a very large combination of machinable features.

This invention provides a method that permits a part to be designed using only machinable profiles. By starting the design process from the same point that one starts the machining process, one can only select acceptable machining operation to arrive at the final part geometry. Consequently the material that is removed from part after each operation is exactly that volume that can be produced by the actual milling operations. The problem then reduces, in part, to selecting an appropriate geometric entity in such a way that a very large number of actual machining operations can be simulated. This entity is called a fundamental manufacturing entity for milling (FMEM). After each simulated milling operation on the computer, the design engineer can display the 3D solid model that resulted from the last and all previous milling operations. Upon completion of the simulated milling operations the individual machining operations can be readily converted into NC code to perform the actual machining of the part. Furthermore, the design engineer will not be limited to a small set of features (holes, slots, pockets etc.) but can use a wide range of machinable features to remove material from the volume remaining from the previous operations.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a perspective view of a schematic representation of the fundamental manufacturing entity for milling (FMEM) as described in this invention.

FIG. 2 illustrates the interrelationship of the various coordinate systems of this invention.

FIG. 3 ilustrates the transformation between the profile, the FMEM and the global coordinate systems.

FIG. 4 is a very general machinable profile for either the cavity or the island in an FMEM.

FIG. 5 illustrates the quadrilateral edges and the end points of the edges.

FIG. 6 illustrates a quadric curve and its end points.

FIG. 7 illustrates a group of three circular arcs and their end points.

FIG. 8 illustrates the input data points to define a profile.

FIG. 9 is a schematical representation of the determination of an extent of a cavity's profile with straight edges and only inner arc groups.

FIG. 10 is a schematical representation of the determination of an extent of a profile with external circular arc groups.

FIG. 11 is a schematical representation of the determination of an arbitrarily oriented extent of a profile with an external quadric curve.

FIG. 12 is a schematical representation of the determination of an arbitrarily oriented extent of a profile with an external quadric curve for the case when the extent is parallel to the x-axis.

FIG. 13 is a schematical representation of the determination of an arbitrarily oriented extent of a profile with an external quadric curve for the case when the extent is parallel to the y-axis.

FIG. 14 is a schematical representation of the two extents that do not overlap.

FIG. 15 is a schematical representation of the two extents that overlap, but their profiles do not intersect.

FIG. 16 is a schematical representation of the two extents that overlap and their profiles intersect.

FIG. 17 illustrates two overlapping extents in their respective FMEM coordinate systems.

FIG. 18 illustrates the six unique combinations of curve intersections.

FIG. 19 shows the intersection of two straight edges when a cavity profile intersects with another cavity profile.

FIG. 20 shows the intersection of two straight edges when a cavity profile intersects with an island profile.

FIG. 21 shows a cavity profile intersects with another cavity profile when the respective starting end points and of the two edges and are outside the intersecting cavities.

FIG. 22 illustration the Vertex Inside Algorithm using semi-infinite lines.

FIG. 23 illustrates the case of the intersection of two edges when a cavity profile intersects with another cavity profile and when the starting end points of both edges are within their respective intersecting cavities.

FIG. 24 illustrates the case of the intersection of two edges when a cavity profile intersects with another cavity profile and when the starting end point of one edge and the final end point of the other edge are within their respective intersecting cavities.

FIG. 25 illustrates the case of the intersection of two edges when a cavity profile intersects with another cavity profile and when both end points of an edge are inside the intersecting cavity.

FIG. 26 illustrates the case of the intersection of two edges when a cavity profile intersects with another cavity profile and when both edges coincide.

FIG. 27 shows the intersection of a straight edge and a quadric curve.

FIG. 28 shows the intersection of a straight edge and a quadric curve for the case when the straight edge is tangential to the quadric curve.

FIG. 29 shows the intersection of the quadric curve and the one of the circular arcs.

FIG. 30 shows the intersection of a circular arc of one cavity profile and a quadric curve of the other cavity profile and an intersection point results from it.

FIG. 31 shows the intersection of a circular arc of one cavity profile and a quadric curve of the other cavity profile and four intersection points result from it.

FIG. 32 shows the case when the quadric curve is tangential to the circular arc.

FIG. 33 shows the case when the quadric curve coincides with the circular arc.

FIG. 34 shows the case when the quadric curve is completely surrounded by the intersecting cavity.

FIG. 35 illustrates the intersection of two circular arcs.

FIG. 36 illustrates the intersection of two quadric curves.

FIG. 37 illustrates the first combination when two cavity profiles intersect and the island profiles remain intact.

FIG. 38 illustrates the second combination when two cavity profiles intersect and one cavity profile intersects with an island profile.

FIG. 39 illustrates the third combination when two cavity profiles intersect and two cavity profiles intersect with each other's island profile.

FIG. 40 illustrates an example of intersection of two cavity profiles.

FIG. 41 shows an enlarged view of the intersection region of FIG. 27.

FIG. 42 illustrates the extents creation when there are several profile intersections.

FIG. 43 illustrates global coordinates defining extents and their overlapped region.

FIG. 44 illustrates a ruled quadric profile shell.

FIG. 45 illustrates two containers that do not intersect.

FIG. 46 illustrates two containers that intersect, but their surfaces do not intersect.

FIG. 47 illustrates two containers that intersect and one or more of their surfaces intersect.

FIG. 48 illustrates the common volume formed by intersection of two containers.

FIG. 49 the six unique combinations of surface intersections.

FIG. 50 illustrates a plane represented in parametric space.

FIG. 51 illustrtates a plane intersecting another plane when a cavity shell intersects with cavity shell.

FIG. 52 illustrtates a plane intersecting another plane when a cavity shell intersects with an island.

FIG. 53 illustrates a cavity shell intersecting another cavity shell when the order for the intersection curves is reversed.

FIG. 54 illustrates a plane that has been dissected into eight patches becuase of the resulting four curves.

FIG. 55 illustrates the case of the intersection of two orthogonal planes when a cavity shell intersects another cavity shell and when the intersection is full.

FIG. 56 illustrates the case of the intersection of two orthogonal planes when a cavity shell intersects another cavity shell and when the intersection is partial.

FIG. 57 illustrates the case of the intersection of two orthogonal planes when a cavity shell intersects another cavity shell and when the directric edge of a plane touches the intersecting plane.

FIG. 58 illustrates the case of the intersection of two orthogonal planes when a cavity shell intersects another cavity shell and when the directric edge of a plane is parallel to the generator line of the intersecting plane.

FIG. 59 illustrates a quadric surface oriented parallel to the z-axis of the local coordinate system.

FIG. 60 illustrates a quadric surface oriented parallel to the y-axis of the local coordinate system.

FIG. 61 illustrates a quadric surface oriented parallel to the x-axis of the local coordinate system.

FIG. 62 shows a plane intersecting a quadric surface.

FIG. 63 shows the case when the plane is tangent to the quadric surface.

FIG. 64 is a schematic determination of the angle for an intersection point.

FIG. 65 illustrates a plane intersecting a cylindrical surface.

FIG. 66 illustrates the relationship of points one a quadric surface.

FIG. 67 shows the intersection of a quadric surface and one of the cylindrical surfaces.

FIG. 68 shows the intersection of two cylindrical surfaces.

FIG. 69 shows the intersection of two quadric surfaces.

FIG. 70 shows two cavity surfaces intersect each other but not the island shells.

FIG. 71 shows two cavity shells intersect each other and with one island shell.

FIG. 72 shows two cavity shells intersect each other and with both islands.

FIG. 73 shows an example of a greatest volume that coincide with the part boundaries.

FIG. 74 shows an example of six greatest volumes in a part.

FIG. 75 illustrates extents and their distances shown on an XY face (n=1 or n=6).

FIG. 76 illustrates extents and their distances shown on a XZ face (n=2 or n=4).

FIG. 77 illustrates extents and their distances shown on a YZ face (n=3 or n=5).

FIG. 78 shows the extents and their distances from the Y-axis on the XY-plane for sorting in the X-direction.

FIG. 79 shows the extents and their distances from the X-axis on the XY-plane for sorting in the Y-direction.

FIG. 80 shows extents on the various surfaces of a part.

FIG. 81 shows the common planes and the extents for the X array.

FIG. 82 shows the common planes and the extents for the Y array.

FIG. 83 shows the common planes and the extents for the Z array.

FIG. 84 shows the bands on X common plane.

FIG. 85 shows the bands on Y common plane.

FIG. 86 shows the bands on Z common plane.

FIG. 87 shows the bands on X common plane create a checker board effect and results in rectangular panels for the X-bands.

FIG. 88 shows the bands Y common plane create a checker board effect and results in rectangular panels for the Y-bands.

FIG. 89 shows the bands on Z common plane create a checker board effect and results in rectangular panels for the Z-bands.

FIG. 90 shows the determination of the greatest volumes.

FIG. 91 shows the circular profile that is used to verify the derived methods.

FIG. 92 shows the rectangular profile that is used to verify the derived methods.

FIG. 93 shows the traingular profile that is used to verify the derived methods.

FIG. 94 shows the elliptical profile that is used to verify the derived methods.

FIG. 95 is a table of combinations of profiles used for the verification of multi-profile intersections on a common surface.

FIG. 96 shows the profiles resultaing from intersections of two circles.

FIG. 97 shows the profiles resultaing from intersections of three circles.

FIG. 98 shows the profiles resultaing from intersections of four circles.

FIG. 99 shows the profiles resultaing from intersections of four circles and a narrow slot.

FIG. 100 shows three circles intersecting in such a way that six intersection points are created.

FIG. 101 shows the profiles resultaing from intersections of two rectangles.

FIG. 102 shows the profiles resultaing from intersections of three rectangles.

FIG. 103 shows the profiles resultaing from intersections of four rectangles.

FIG. 104 shows the profiles resultaing from intersections of four rectangles and a narrow slot.

FIG. 105 shows the profiles resultaing from intersections of two triangles.

FIG. 106 shows the profiles resultaing from intersections of three triangles.

FIG. 107 shows the profiles resultaing from intersections of four triangles.

FIG. 108 shows the profiles resultaing from intersections of four triangles and a narrow slot.

FIG. 109 shows the profiles resultaing from intersections of two ellipses.

FIG. 110 shows the profiles resultaing from intersections of three ellipses.

FIG. 111 shows the profiles resultaing from intersections of four ellipses.

FIG. 112 shows the profiles resultaing from intersections of four ellipses and a narrow slot.

FIG. 113 shows the profiles resultaing from various intersections of four different profiles.

FIG. 114 shows the profiles resultaing from various intersections of four different profiles and a narrow slot.

FIG. 115 is a table of combinations of similar shell profiles used for the verification of two orthogonally intersecting FMEMs.

FIG. 116 is a table of combinations of dissimilar shell profiles used for the verification of two orthogonally intersecting FMEMs.

FIG. 117 shows the profiles resulting from ortogonally intersecting same size circular profile shells.

FIG. 118 shows the profiles resulting from ortogonally intersecting not same size circular profile shells.

FIG. 119 shows the profiles resulting from ortogonally intersecting not same size circular profile shells when the axes of two profile shells are not in the same plane.

FIG. 120 shows the profiles resulting from ortogonally intersecting same size rectangular profile shells.

FIG. 121 shows the profiles resulting from ortogonally intersecting not same size rectangular profile shells.

FIG. 122 shows the profiles resulting from ortogonally intersecting not same size rectangular profile shells when the axes of two profile shells are not in the same plane.

FIG. 123 shows the profiles resulting from ortogonally intersecting same size elliptical profile shells.

FIG. 124 shows the profiles resulting from ortogonally intersecting not same size elliptical profile shells.

FIG. 125 shows the profiles resulting from ortogonally intersecting not same size elliptical profile shells when the axes of two profile shells are not in the same plane.

FIG. 126 shows the profiles resulting from ortogonally intersecting a circular and a same size rectangular profile shells.

FIG. 127 shows the profiles resulting from ortogonally intersecting a circular and a smaller size rectangular profile shells.

FIG. 128 shows the profiles resulting from ortogonally intersecting a circular and a smaller size rectangular profile shells when the axes of two profile shells are not in the same plane.

FIG. 129 shows the profiles resulting from ortogonally intersecting a rectangular and a same size elliptical profile shells.

FIG. 130 shows the profiles resulting from ortogonally intersecting a rectangular and a smaller size elliptical profile shells.

FIG. 131 shows the profiles resulting from ortogonally intersecting a rectangular and a smaller size elliptical profile shells when the axes of two profile shells are not in the same plane.

FIG. 132 shows the profiles resulting from ortogonally intersecting an elliptical and a same size circular profile shells.

FIG. 133 shows the profiles resulting from ortogonally intersecting an elliptical and a smaller size circular profile shells.

FIG. 134 shows the profiles resulting from ortogonally intersecting an elliptical and a smaller size circular profile shells when the axes of two profile shells are not in the same plane.

FIG. 135 illustrates the profiles shown on various faces of the stock block.

FIG. 136 illustrates the resultant geometry of the example part.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

FIG. 1 illustrates the Fundamental Manufacturing Entity for Milling (FMEM), which is defined as the smallest solid volume that contains all the geometric information necessary to describe the shape of the volume of material removed during machining. The FMEM is a regular rectangular prismatic geometry containing a cavity and an island within the cavity. The shapes of the cavity and the island are each represented by very general profiles. The outer profile is contained within the smallest rectangular box of dimension U and V such that these edges are parallel to, and coincide with, the local coordinate axes x and y. The profile of the island can have any orientation with respect to the profile of the outer boundary, which in turn can have any orientation with respect to the coordinate axes x and y. The depth of the cavity and the depth of the prismatic block are equal. The profile can be applied to any of the six surfaces of the prismatic block.

The three coordinate systems used in the modeling scheme are (i) the global coordinate system, (ii) the FMEM coordinate system, and (ii) the profile coordinate system. Referring to FIG. 2 the global coordinate system (X,Y,Z) is a right handed Cartesian system with its origin at the top left corner of the part stock. This system is chosen such that the working plane is the XY plane, and the Z-axis is pointing towards the stock material.

The FMEM coordinate system (x,y,z) is also a right handed Cartesian system. This system is always oriented parallel to the global coordinate system. The three axes of the FMEM coordinate system coincide with three mutually orthogonal edges of the FMEM.

The machining profile coordinate system (u,v,w) is also a right handed Cartesian system. There are at most two profile coordinate systems within the FMEM, one is used to characterize the outer (cavity) profile and the other the inner (island) profile. The two profile coordinate systems are independent of each other. FIG. 3.2 shows the profile coordinate systems (u₁,v₁,w₁) and (u₂,v₂,w₂) for the outer profiles of (FMEM)₁ and (FMEM)₂, respectively. The profiles are created in their respective profile coordinate system. They are then transformed to the desired orientation with respect to the (x,y,z) axes of the FMEM coordinate system. These various transformations are discussed in the next section.

A profile is created in the profile coordinate system (u,v,w) on the uv-plane and oriented in FMEM coordinate system by specifying the origin of the profile coordinate system (u₀,v₀,0) and the orientation angle φ with respect to the FMEM coordinate system. The transformation from the (u,v,w) system to the FMEM coordinate system (x,y,z) is given by ##EQU1## where

    L=[x y z 1]

    L.sub.f =[u v w 1]

It is noted that L_(f) can represent a point in the coordinate system for either the outer profile or the island profile. The transformation from the FMEM coordinate system to the global coordinate system is simply a translation. Thus, ##EQU2## where (x₀,y₀,z₀) are the coordinates of the origin of the FMEM coordinate system in the global coordinate system. The significance of z₀ will become apparant in the discussion of profile intersection on a surface provided subsequently in this disclosure.

The transformation of a point in the (u,v,w) coordinate system on face 1 to any other five faces (2 to 6) shown in FIG. 3 is given by ##EQU3## where U, V, and d are the dimensions of the FMEM in the x, y and z directions, respectively. The quantities U and V are determined by the method described subsequently. The depth d is specified by the user. In the development of the working equations the inverse of these transformation matrices are required. Thus ##EQU4##

A general profile for either the cavity or the island in an FMEM is shown in FIG. 4. The notation used to describe this very general profile is as follows. The left superscript indicates the surface number of the prismatic volume, the left subscript is reserved for the profile number and the two right subscripts separated by a comma identify the type of the curve of the profile. The very general profile is comprised of four straight edges e_(j), four quadric curves q_(j) and four groups of three circular arcs g_(j),k. In its most general case, these edges and curves are an ordered combination of up to four quadrilateral edges of different lengths, up to four quadric curves of different curvature and up to four groups of three circular arcs of different radii. Any of the intermediate circular arc groups may lie either inside the boundary of the quadrilateral formed by the edges or outside the boundary as shown in FIG. 4.

A straight edge _(v) ^(n) e_(j) =0 of profile von surface n, n=1, . . . , 6, as shown in FIG. 5, is bounded by two points P_(j),1 and P_(j),6, j=1,2,3,4, where the points P_(j),1 and P_(j),6 are given in the FMEM coordinate system (x,y,z). The implicit representation of the edge _(v) ^(n) e_(j) =0 in matrix form with respect to the FMEM coordinate system is provided by Levin, 1976.

    .sub.v.sup.n e.sub.j (P.sub.j,1, P.sub.j,6 ; P)=L M.sub.n E.sub.j M.sub.n.sup.T L.sup.T =0 j=1,2,3,4 n=1, . . . , 6         (3.5)

where P is the point (x,y,z) on the straight line connecting P_(j),1 and P_(j),6, L and M_(n) are given by equation (3.1) and equation (3.4), respectively, and L^(T) and M_(n) ^(T) are the transposes of L and M_(n), respectively. Note that P is simply the scalar form of L. The matrix E_(j) is ##EQU5##

The coefficients G_(j), H_(j) and K_(j) are determined by the end points P_(j),1 and P_(j),6 of the edge _(v) ^(n) e_(j) =0 and are given by

    G.sub.j =(y.sub.j,1 -y.sub.j,6)/2

    H.sub.j =(x.sub.j,6 -x.sub.j,1)/2

    K.sub.j =x.sub.j,1 y.sub.j,6 -x.sub.j,6 y.sub.j,1          (3.7)

where (x_(j),1,y_(j),1) and (x_(j),6, y_(j),6) are the coordinates of the points P_(j),1 and P_(j),6, respectively in the FMEM coordinate system. These coordinate values are obtained from the coordinate transformation of each point (L_(f)) as indicated in equation (3.1). When the straight edge _(v) ^(n) e_(j) is omitted, P_(j),1 =P_(j),2 and P_(j),4 =P_(j),5.

A quadric curve _(v) ^(n) q_(j) =0 on surface n, n=1, . . . , 6 is bounded by two edges _(v) ^(n) e_(j) =0 and _(v) ^(n) e_(j+1) =0 as shown in FIG. 6. It is constructed using Pascal's theorem (Faux & Pratt, 1979) to yield

    (1-λ.sub.j) .sub.v.sup.n e.sub.j .sub.v.sup.n e.sub.j+1 +λ.sub.j .sub.v.sup.n ε.sub.j.sup.2 =0 j=1,2,3,4; n=1, . . . , 6                                                     (3.8)

When j=4, _(v) ^(n) e₅ =_(v) ^(n) e₁. The line _(v) ^(n) ε_(j) =0 is the line connecting the two points P_(j),6 and P_(j+1),1, which for j=4 yields P₁,1 =P₅,1. Furthermore, λ_(j) is a real number obtained by solving the equation (3.8) at the shoulder point P_(j),7. Thus, λ_(j) =1/(1-f₁ f₂), where

    f.sub.1 =.sub.v.sup.n ε.sub.j (P.sub.j,6, P.sub.j+1,1)/.sub.v.sup.n e.sub.j (P.sub.j,1, P.sub.j,6 ; P.sub.j,7)

    f.sub.2 =.sub.v.sup.n ε.sub.j (P.sub.j,6, P.sub.j+1,1)/.sub.v.sup.n e.sub.j+1 (P.sub.j+1,1, P.sub.j+1,6 ; P.sub.j,7)

The shoulder point is specified inside the area bounded by the two edges _(v) ^(n) e_(j) =0 and _(v) ^(n) e_(j+1) =0, and the line _(v) ^(n) ε_(j) =0. This guarantees that the quadric curve passes through the shoulder point P_(j),7 and is tangential to the edges _(v) ^(n) e_(j) =0and _(v) ^(n) e_(j+1) =0 at P_(j),6 and P_(j+1),1, respectively. The line _(v) ^(n) ε_(j) =0 is given by

    .sub.v.sup.n ε.sub.j =2a.sub.j x+2b.sub.j y+c.sub.j =0 (3.9)

where

    a.sub.j =(y.sub.j,6 -y.sub.j+1,1)/2

    b.sub.j =(x.sub.j+1,1 -x.sub.j,6)/2

    c.sub.j =x.sub.j,6 y.sub.j+1,1 -y.sub.j,6 x.sub.j+1,1      (3.10)

The coordinates (x_(j),6,y_(j),6) and (x_(j+1),1,y_(j+1),1) are the coordinates of the points P_(j),6 and P_(j+1),1, respectively, in the FMEM coordinate system. The coordinates x_(j),6, y_(j),6, x_(j+1),1 and y_(j+1),1 are obtained from the coordinate transformation of each point L_(f) as indicated in equation (3.1).

Substituting the expressions for _(v) ^(n) e_(j), _(v) ^(n) e_(j+1), _(v) ^(n) ε_(j) and λ_(j) in equation (3.8) yields the following implicit equation for the quadric curves on faces 1 through 6:

    .sub.v.sup.n q.sub.j (e.sub.j, e.sub.j+1 ; P)=L M.sub.n Q.sub.j M.sub.n.sup.T L.sup.T =0 j=1,2,3,4; n=1, . . . , 6        (3.11)

where P=(x,y,z) is a point on the quadric curve bounded by P_(j),6 and P_(j+1),1 and passing through P_(j),7, ##EQU6## and A_(j), B_(j), D_(j), G_(j), H_(j) and K_(j) are

    A.sub.j =4G.sub.j G.sub.j+1 (1-λ.sub.j)+4λ.sub.j a.sub.j.sup.2

    B.sub.j =4H.sub.j H.sub.j+1 (1-λ.sub.j)+4λ.sub.j b.sub.j.sup.2

    D.sub.j =2(G.sub.j H.sub.j+1 +H.sub.j G.sub.j+1)(1-λ.sub.j)+4λ.sub.j a.sub.j b.sub.j

    G.sub.j =(G.sub.j K.sub.j+1 +K.sub.j G.sub.j+1)(1-λ.sub.j)+2λ.sub.j a.sub.j c.sub.j

    H.sub.j =(H.sub.j K.sub.j+1 +K.sub.j H.sub.j+1)(1-λ.sub.j)+2λ.sub.j b.sub.j c.sub.j

    K.sub.j =K.sub.j K.sub.j+1 (1-λ.sub.j)+λ.sub.j c.sub.j.sup.2

    j=1,2,3,4                                                  (3.13)

where G_(j), H_(j) and K_(j) are given by equation (3.7) and which, for the case of j=4, G₅ =G₁, H₅ =H₁ and K₅ =K₁. The quantities a_(j), b_(j) and c_(j) are given by equation (3.10). When the quadric curve is omitted, P_(j),1 =P_(j+1),1 =P_(j),8. For the case of j=4, P₄,1 =P₁,1 =P₄,8.

A representative group of the circular arcs is shown in FIG. 7. Each of the three circular arcs _(v) ^(n) g_(j),k =0, k=1,2,3, is tangent to each other. The arcs _(v) ^(n) g_(j),1 and _(v) ^(n) g_(j),3 are tangential to the edge _(v) ^(n) e_(j) =0 in the manner shown. Each arc _(v) ^(n) g_(j),k =0, k=1,2,3, is bounded by the computationally obtained tangential points P_(j),k+1 and P_(j),k+2, k=1,2,3. The points P_(j),2 and P_(j),5 are determined in a similar manner when the straight edge _(v) ^(n) e_(j) =0 is tangent to the arcs _(v) ^(n) g_(j),1 =0 and _(v) ^(n) g_(j),3 =0. The points P_(j),3 and P_(j),4 are the points at which the arcs _(v) ^(n) g_(j),1 =0 and _(v) ^(n) g_(j),3 =0 are tangent to the arc _(v) ^(n) g_(j),2 =0, respectively. All these tangent points are determined after each arc's center location and radius are specified.

The implicit representation of the arcs _(v) ^(n) g_(j),k =0 of profile v on face n is given by ##EQU7## where P=(x,y,z) is a point on the kth arc that is bounded by the points P_(j),k+1 and P_(j),k+2, ##EQU8## where G_(jk), H_(jk) and K_(jk) are the coefficients determined by the center points C_(j),k and radii r_(j),k of arcs _(v) ^(n) g_(j),k such that

    G.sub.jk =-xc.sub.j,k

    H.sub.jk =-yc.sub.j,k

    K.sub.jk =xc.sub.j,k.sup.2 +yc.sub.j,k.sup.2 -r.sub.j,k.sup.2 (3.16)

and (xc_(j),k, yc_(j),k) are the coordinates of the center points C_(j),k. As shown in FIG. 7, only the segment of an arc that is clockwise is drawn. The directions of the arcs are determined by information about whether a group of arcs is inside or outside the quadrilateral formed by the edges _(v) ^(n) e_(j) =0,j=1,2,3,4. When the group of arcs _(v) ^(n) g_(j) is omitted, P_(j),2 =P_(j),1 and P_(j),5 =P_(j),6.

The ordered collection of the three arcs is defined as _(v) ^(n) g_(j) and is given by ##EQU9##

The cavity and the island profiles are described by any ordered combination of these straight edges, quadric curves and groups of circular arcs such that the total perimeter for each of these profiles for the cavity _(v) ^(n) S_(C) and the island _(v) ^(n) S_(I) are given by ##EQU10## where σ=C or I and ##EQU11## The values of P are those points restricted to lie on the specific lines, curves and arcs as previously indicated.

The general profile given by equation (3.18) is composed of a combination of straight edges, circular arcs and quadric curves. The engineer can choose any ordered combination of the curves comprising the profile to attain the desired profile. A profile v is specified by manipulating the individual curves (_(v) ^(n) e_(j), _(v) ^(n) q_(j), _(v) ^(n) g_(j)) in the general profile _(v) ^(n) S.sub.σ (P). In addition, any curve in the profile may be omitted when describing a profile shape. This missing curve is specified as False in the data structure and no data are input for that curve. Referring to FIG. 8, an edge _(v) ^(n) e_(j) is defined by the coordinates of the vertices P_(j),1 and P_(j),6, the circular arcs _(v) ^(n) g_(j),k are specified by the coordinates of their center points C_(j),k, their radii r_(j),k and "dir", and the quadric curve _(v) ^(n) q_(j) is defined by its shoulder point P_(j),7, its knee point P_(j),8 and the tangent lines _(v) ^(n) e_(j) =0 and _(v) ^(n) e_(j+1) =0. The outside and island profiles are specified in their respective profile coordinate systems (u,v,w), which are then oriented in the xy-plane of the FMEM by specifying their corresponding (u₀,v₀,w₀) and φ (see FIG. 3). A hole is specified by its center point and its radius. A rectangular pocket has its input specified by the end points of four straight edges and the coordinates of the shoulder and knee points of the four quadric curves.

The transformation of the feature profiles from their (u,v,w) system to their (x,y,z) system requires the computation of the matrices E_(j), J_(jk) and Q_(j). The data for a profile in the (x,y,z) system are then stored for subsequent use by the modeling system. The computed data for these twenty (20) matrices for each feature profile, along with their respective vertices are stored accordingly. Each edge _(v) ^(n) e_(j) is described by its matrix E_(j) and the two vertices P_(j),1 and P_(j),6 bounding the edge. Each quadric curve _(v) ^(n) q_(j) is described by its matrix Q_(j), its shoulder point P_(j),7 and its knee point P_(j),8. Each circular arc _(v) ^(n) g_(j),k is expressed by its matrix J_(jk) and the points P_(j),k+1 and P_(j),k+2 bounding each arc. Thus the inner and outer profiles of a cavity on any one face of the FMEM can be described, in general, as an ordering of four edge matrices, twelve circular arc matrices and four quadric curve matrices, and the vertices that bound each of these curves.

The determination of a profile's extent will now be described.

The minimum rectangle that surrounds a cavity profile is called an extent. An extent is completely defined by the coordinates of two of its diagonal corners, (x_(min),y_(min)) and (x_(max),y_(max)), in the FMEM coordinate system. The minimum and maximum values of a coordinate (either x or y) are found by sequencing through the list of the coordinates of the points P_(j),i, j=1, . . . , 4 and i=1, . . . , 6, and recording the smallest and the largest values for each coordinate. This minimum rectangle, as shown in FIG. 9, contains a feature profile that is formed by the edges _(v) ^(n) e_(j) and the inner arc groups. It is possible, however, that some portions of the quadric curves _(v) ^(n) q_(j) lie outside the minimum rectangle obtained in this manner. In addition, the circular arc groups that are outside the quadrilateral that is formed by joining the points P_(j),8, j=1, . . . , 4, will also lie outside this minimum rectangle. The minimum rectangle, therefore, is reexamined if such circular arc groups are used and the quadric curves found in the profile.

Referring to FIG. 10, the following tests are performed to determine the maxima and minima of x and y when a circular curve _(v) ^(n) g_(j),k of radius r_(j),k with its center at (xc_(j),k,yc_(j),k) is outside the quadrilateral of the profile (dir is counterclockwise):

    (a) If x.sub.min >xc.sub.j,k -r.sub.j,k, then x.sub.min =xc.sub.j,k -r.sub.j,k

    (a) If x.sub.min >xc.sub.j,k -r.sub.j,k, then x.sub.min =xc.sub.j,k -r.sub.j,k

    (b) If y.sub.min >yc.sub.j,k -r.sub.j,k, then y.sub.min =yc.sub.j,k -r.sub.j,k

    (c) If x.sub.max <xc.sub.j,k +r.sub.j,k, then x.sub.max =xc.sub.j,k +r.sub.j,k

    (d) If y.sub.max <yc.sub.j,k +r.sub.j,k, then y.sub.max =yc.sub.j,k +r.sub.j,k

However, the previously determined values of x_(min), y_(min), x_(max) and y_(max) remain unchanged if none of these conditions is met.

The maxima and minima of x and y, when at least one quadric curve _(v) ^(n) q_(j), j=1, . . . , 4 is in the profile, are determined in the following manner. Consider a point (x_(o),y_(o)), as shown in FIG. 11, through which the quadric curve _(v) ^(n) q_(j) passes. The tangent at (x_(o),y_(o)) makes an angle ψ_(o) with the x-axis of the FMEM coordinate system. Expanding equation (3.11) for n=1 at (x_(o),y_(o)) in the FMEM coordinate system, and using some results from Faux and Pratt (1979), it is found that the following two equations are obtained from which the point (x_(o),y_(o)) can be determined:

    A.sub.j x.sub.o.sup.2 +B.sub.j y.sub.o.sup.2 +2D.sub.j x.sub.o y.sub.o +2G.sub.j x.sub.o +2H.sub.j y.sub.o +K.sub.j =0           (3.20)

    (A.sub.j x.sub.o +D.sub.j y.sub.o +G.sub.j) cos ψ.sub.o +(D.sub.j x.sub.o +B.sub.j y.sub.o +H.sub.j) sin ψ.sub.o =0     (3.21)

When the tangent is horizontal, as shown in FIG. 12, ψ_(o) =0. Then the roots of equations (3.20) and (3.21) are denoted x_(o1) and x_(o2). The values x_(o1) and x_(o2) are evaluated to determine if any of these values lie between x_(j),1 and x_(j+1),6. If both roots do not lie between x_(j),6 and x_(j+1),1, then they are rejected. If one of the roots, either x_(o1) or x_(o2), lies between x_(j),6 and x_(j+1),1, then its value is substituted into equation (3.21) to get a value of y_(o). The root that does not lie between x_(j),6 and x_(j+1),1 is rejected. Only positive values of y_(o) are accepted. If y_(o) <y_(min), then y_(min) =y_(o) ; if y_(o) >y_(max), then y_(max) =y_(o). If x_(j),6 ≦X_(ok) ≦x_(j+1),1, k=1,2, then the two values x_(ok), k=1,2 are substituted into equation (3.21) to yield two values y_(ok), k=1,2. When y₀₁ <y_(o2) and if y_(o1) <y_(min), then y_(min) =y_(o1) ; if y_(o2) <y_(max), then y_(max) =y_(o2). When y₀₂ <y_(o1), and if y_(o2) <y_(min), then y_(min) =y_(o2) ; if y_(o1) <y_(max), then y_(max) =y_(o1).

When the tangent is vertical as shown in FIG. 13, ψ_(o) =π/2. Then the roots of equations (3.20) and (3.21) are denoted y_(o1) and y_(o2). The values y_(o1) and y_(o2) are calculated to determine if any of these values lie between y_(j),6 and y_(j+1),1. If both roots do not lie between y_(j),6 and y_(j+1),1, then they are rejected. If one of the roots, either y_(o1) or y_(o2), lies between y_(j),6 and y_(j+1),1, then its value is substituted into equation (3.21) to get a value of x_(o). The root that does not lie between y_(j),6 and y_(j+1),1 is rejected. Only positive values of x_(o) are accepted. If x_(o) <x_(min), then x_(min) =x_(o) ; if x_(o) >x_(max), then x_(max) =x_(o). If y_(j),6 ≦y_(ok) ≦y_(j+1),1, k=1,2, then the two values y_(ok), k=1,2 are substituted into equation (3.21) to yield two values x_(ok), k=1,2. When x₀₁ <x_(o2), and if x_(o1) <x_(min), then x_(min) =x_(o1) ; if x_(o2) <x_(max), then x_(max) =x_(o2). When x₀₂ <x_(o1), and if x_(o2) <x_(min), then x_(min) =x_(o2) ; if x_(o1) <x_(max), then x_(max) =x_(o1).

The foregoing description introduced the fundamental manufacturing entity for milling. It explained how a profile is represented in the FMEM, what input data are required and in what form they are stored. The governing equations representing the individual components of the profile were also given. The following description will detail how these general profiles can be combined so that the intersection of any number of profiles of an FMEMs on a given face n can be handled.

An entity for modeling the volume removed by a milling operation, called the FMEM, was introduced above. This entity represents the various shapes of the cavity and island profiles that are created by a milling operation. During the design process the designer may want to achieve a shape that is not attainable from the very general profile given by equation (3.18), but can be achieved with the intersection of two or more profiles on a given surface. In order to do this a means must be developed to incorporate a profile that is formed by the intersection of many profiles on any of the six faces. The algorithm to calculate such intersections is discussed in this chapter. Identifying and calculating these intersections require that a means first be developed to determine if an intersection of the profiles has taken place. If it has, then all their intersection points are determined and the new profile is formed. This process can then be repeated to calculate the intersection of additional profiles. The final FMEM can then be stored and used throughout the design process.

The use of extents to describe the intersection of profiles will now be discussed. Consider two extents F₁ and F₂. These two extents can be related to each other in one of three ways: (1) they do not overlap; (2) they overlap, but their profiles do not intersect; and (3) they overlap and their profiles intersect. FIG. 14 shows the case where the extents do not overlap. For this case the extents F₁ and F₂ contain the profiles of two independent FMEMs, (FMEM)₁ and (FMEM)₂. The procedure to define a profile of an FMEM in an extent was discussed above. FIG. 15 shows the case of two overlapping extents F₁ and F₂ in which the profiles do not intersect In this case a third extent F₃ surrounds the two overlapping extents, and the extent F₃ is a new extent containing the two non-intersecting profiles ₁ ^(n) S_(C) (P) and ₂ ^(n) S_(C) (P). The curves of the profiles ₁ ^(n) S_(C) (P) and ₂ ^(n) S_(C) (P) when contained in the same extent, but do not intersect, are designated as combination C₀.

FIG. 16 shows the case when the two extents F₁ and F₂ overlap, and some of the curves of the two profiles ₁ ^(n) S_(C) (P) and ₂ ^(n) S_(C) (P) intersect.

The test to determine whether or not two FMEM profiles intersect consists of two parts. The first part uses the extents of the individual profiles. Referring to FIG. 17, the two extents F₁ and F₂ are represented in their respective local FMEM coordinate systems (x₁,y₁) and (x₂,y₂) on the face n. Each of the extents is oriented parallel to the global coordinate system (X,Y). However, the orientation of their respective profiles are with respect to the individual coordinate system (x,y). Recall equation (3.1). The overlapped region F, which is the region common to extents F₁ and F₂, is first identified. When two extents overlap they are surrounded by a third extent F₃, which is the smallest rectangle that encloses F₁ and F₂, and is expressed in the composite FMEM coordinate system (x,y). The profiles enclosed by the extents F₁ and F₂ can only intersect in the common region F. The coordinates of the bottom right hand corner of the region F in the (x,y) coordinate system are (x_(min),y_(min)) and the coordinates of the top left hand corner are (x_(max),y_(max)).

The second part of the test is applied only to the curves e_(j), q_(j) and g_(j) of the two profiles ₁ ^(n) S_(C) (P) and ₂ ^(n) S_(C) (P) that are present within the region F. Each curve of the two profiles is evaluated to determine whether or not it is within the region F If it is within F it is marked for further processing. Referring to FIG. 18 it is seen that there are only six unique combinations of intersections among the curves e_(j), q_(j) and g_(j) of the two profiles ₁ ^(n) S_(C) (P) and ₂ ^(n) S_(C) (P) on a given face n. The combinations are denoted C_(k), k=1, . . . , 6. The combinations C₁, C₂ and C₃ represent interactions of an edge ₁ ^(n) e_(j) with another edge ₂ ^(n) e_(j), with a quadric curve ₂ ^(n) q_(j), and with any one of the circular arc group ₂ ^(n) g_(j), respectively. The combinations C₄, C₅ and C₆ represent intersections of two second order curves. Recall that when the curves do not intersect in the region F they are denoted C₀. Each intersection involving two second order curves is tested using the Sylvester's resultant method (Hoffman, 1989), in which the Sylvester's determinant |R_(x) | is expressed in terms of the coordinate variable x. This determinant is obtained by expressing all the terms containing the variable x as coefficients of the y coordinate. The combinations C₁, C₂ and C₃ are relatively easy to process, since only a qaudratic equation is solved to determine their intersection points. It should be noted that of the three combinations of profiles that can intersect, only two are physically realizable. The third, the intersections of two islands, is not admissible.

The six unique intersections C_(k), k=1, . . . , 6 can be determined by introducing a general curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P), i=1,2,3,4,5; n=1, . . . , 6 and v=1,2 . . . of a profile _(v) ^(n) S.sub.σ (P), σ=C or I, on face n. This curve is bounded by the points U_(i) and U_(i+1), and P=(x,y,z) is a point on the curve. The curve is given in the composite FMEM's coordinate system (x, y, z) as follows:

    .sub.v.sup.n γ.sub.j (U.sub.i, U.sub.i+1 ; P)=L Γ.sub.i L.sup.T =0 i=1,2,3,4,5;n=1, . . . , 6                             (4.1)

For i=1, the curve _(v) ^(n) γ₁ represents the straight edge _(v) ^(n) e_(j) and Γ₁ =E_(j) ; for i=2,3,4 _(v) ^(n) γ_(i) represents one of the circular arcs _(v) ^(n) g_(j),k, k=1,2,3 and Γ_(i) =J_(jk) ; and for i=5 _(v) ^(n) γ₅ represents a quadric curve _(v) ^(n) q_(j) and Γ₅ =Q_(j). Furthermore, U_(i) =P_(j),i and U_(i+1) =P_(j),i+1 except for i=5, where U_(i) =P_(j),i+1 and U_(i+1) =P_(j+1j-4). The coordinates of the points U_(i) and U_(i+1) in the (x,y,z) coordinate system are given by (x_(i),y_(i),z_(i)) and (x_(i+1),y_(i+1),z_(i+1)), respectively.

Consider an intersection of a cavity ₁ ^(n) S_(C) (P) with either another cavity ₂ ^(n) S_(C) (P) or an island ₂ ^(n) S_(I) (P). An island does not intersect with another island. Each of the six combinations C_(k), k=1, . . . , 6 for the intersections of a cavity with another cavity and a cavity with an island are discussed in the following sections. It is shown how the intersection points R_(l), l=1, . . . , x are found. The quantity x is the total number of intersection points. The intersection points R_(l) are the roots of the polynomials of the intersecting curves ₁ ^(n) γ_(i) and ₂ ^(n) γ_(i). Hence, the problem is reduced to finding the roots of the two polynomials of the intersecting curves ₁ ^(n) γ_(i) and ₂ ^(n) γ_(i) for each of the six combinations.

In case of a cavity ₁ ^(n) S_(C) (P) intersecting with another cavity ₂ ^(n) S_(C) (P), the N_(p1) intersection points R_(l), i=1, . . . , N_(p1) are found for the intersection of a curve ₁ ^(n) γ_(i) of a cavity ₁ ^(n) S_(C) (P) with all the curves of the intersecting cavity ₂ ^(n) S_(C) (P). These intersection points R_(l), l=1, . . . , N_(p1) are then collected and ordered along the curve ₁ ^(n) γ_(i). The curve ₁ ^(n) γ_(i) is then segmented using the intersection points R_(l), l=1, . . . , N_(p1). An algorithm, which is described in the preceding section, is then used to determine the segments that are removed and the segments that remain after the intersection. This procedure is repeated for all the curves of the cavity ₁ ^(n) S_(C) (P). Similarly, the N_(p2) intersection points R_(l), l=1, . . . , N_(p2) found for the intersection of a curve ₂ ^(n) γ_(i) of the cavity ₂ ^(n) S_(C) (P) with all the curves of the intersecting cavity ₁ ^(n) S_(C) (P) are collected and then ordered along the curve ₂ ^(n) γ_(i). The segments of the curve ₂ ^(n) γ_(i) are then determined using the intersection points R_(l), l=1, . . . , N_(p2) and the same algorithm is used to identify the segments that are removed and the segments that remain. This is repeated for all the curves of the cavity ₂ ^(n) S_(C) (P).

For the case of a cavity ₁ ^(n) S_(C) (P) intersecting with an island ₂ ^(n) S_(C) (P), only the curves ₂ ^(n) γ_(i) of the island are affected. The cavity ₁ ^(n) S_(C) (P) removes the material from the island ₂ ^(n) S_(C) (P). However, an island ₂ ^(n) S_(I) (P) does not remove material from the cavity ₁ ^(n) S_(C) (P). Thus, for such an intersection, the curves ₁ ^(n) γ_(i) of the cavity ₁ ^(n) S_(C) (P) are not considered and only the curves ₂ ^(n) γ_(i) of the island ₂ ^(n) S_(I) (P) in the region F are considered. The N_(p2) intersection points R_(l), l=1, . . . , N_(p2) are found for the intersection of a curve ₂ ^(n) γ_(i) of the island ₂ ^(n) S_(I) (P) with all the curves of the intersecting cavity ₁ ^(n) S_(C) (P). These intersection points are then collected and ordered along the curve ₂ ^(n) γ_(i). The segments of the curve ₂ ^(n) γ_(i) are determined using the intersection points R_(l), l=1, . . . , N_(p2) and the segments that removed and the segments that remain are identified.

The following discussion explains in detail the six intersection combinations C_(k), k=1, . . . , 6, for a cavity ₁ ^(n) S_(C) (P) intersecting with either another cavity ₂ ^(n) S_(C) (P) or with an island ₂ ^(n) S_(I) (P).

The combination C₁ denotes the intersection of the two straight edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P), which are each described by equation (3.5). Expanding their respective equations for face n in the (x,y) coordinate system yields

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=2 .sub.1.sup.n G.sub.j x+2 .sub.1.sup.n H.sub.j y+.sub.1.sup.n K.sub.j =0        (4.2a)

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=2 .sub.2.sup.n G.sub.j x+2 .sub.2.sup.n H.sub.j y+.sub.2.sup.n K.sub.j =0        (4.2b)

Solving for x and y we get

    x.sub.e =1/2(.sub.2.sup.n H.sub.j .sub.1.sup.n K.sub.j -.sub.1.sup.n H.sub.j .sub.2.sup.n K.sub.j)/D.sub.0                     (4.3a)

    y.sub.e =1/2(.sub.2.sup.n K.sub.j .sub.1.sup.n G.sub.j -.sub.1.sup.n K.sub.j .sub.2.sup.n G.sub.j)/D.sub.0                     (4.3b)

where

    D.sub.0 =.sub.1.sup.n H.sub.j .sub.2.sup.n G.sub.j -.sub.1.sup.n G.sub.j .sub.2.sup.n H.sub.j                                      (4.3c)

It can be seen from equations (4.3a) and (4.3b) that the two edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) do not intersect if D₀ =0. When D₀ ≠0 equations (4.3a) and (4.3b) yield the intersection point R₁ =(x_(e),y_(e)). Each intersection combination C₁ yields only one intersection point. However, the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) may intersect with other curves ₁ ^(n) γ_(i), i=2,3,4,5, of the cavity profile ₂ ^(n) S_(C) (P) and may have N_(p1) intersection points; that is, R_(l), l=1, . . . , N_(p1). Similarly, the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) may intersect with other curves ₁ ^(n) γ_(i), i=2,3,4,5 of the profile ₁ ^(n) S_(C) (P) and may have N_(p2) intersection points; that is, R_(l), l=1, . . . , N_(p2). This is illustrated in FIGS. 19 and 20. FIG. 19 shows the intersection of two straight edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) when a cavity profile ₁ ^(n) S_(C) (P) intersects with another cavity profile ₂ ^(n) S_(C) (P). FIG. 20 shows the intersection of two edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) when a cavity profile ₁ ^(n) S_(C) (P) intersects with an island profile ₂ ^(n) S_(I) (P). The intersection point R₁ that results from the intersection of the straight edges is obtained from equations (4.3a) and (4.3b). Another intersection point R₂, shown in FIGS. 19 and 20, results from the intersection of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) with one of the curves ₁ ^(n) γ_(i), i=2,3,4,5, of the cavity profile ₁ ^(n) S_(C) (P). The procedure for obtaining R₂ is explained subsequently.

FIGS. 19 and 20 show that the straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) has only one intersection point R₁, whereas the straight edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) has two intersection points R₁ and R₂. Therefore, the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) can be divided into two segments ₁ ^(n) χ₁,1 (U_(i), R₁ ; P) and ₁ ^(n) χ₁,2 (R₁, U_(i+1) ; P). The edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) is subdivided into three segments; however, they cannot be identified until it has been determined whether R₁ or R₂ is closer to the end point ₂ ^(n) U_(i). In other words, the intersection points R₁ and R₂ need to be ordered along the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). This ordering is done only if there are more than one intersection points for the edge and is achieved by converting the implicit equation (4.2a) of the edge to the parametric form, which will be in terms of parameter t given by ##EQU12##

It can be seen from equation (4.4) that t=0 at the starting point ₂ ^(n) U_(i) and that t=1 at the terminating point ₂ ^(n) U_(i+1) of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). When the point lies on the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) between points U_(i) and U_(i+1), then 0<t<1. However, a point that precedes U_(i) will have t<0 and a point that follows U_(i+1) will have t>1. The value t(R₁) is obtained by substituting x=x_(e) when x_(i+1) ≠x_(i), or y=y_(e) when x_(i) =x_(i+1), into equation (4.4). Similarly, t(R₂) is calculated by substituting the appropriate coordinates of the intersection point R₂ into equation (4.4). The intersection points are then ordered in ascending order for the parameter t. If t(R₁)<t(R₂) then the order is ₂ ^(n) U_(i), R₁, R₂ and ₂ ^(n) U_(i+1) ; otherwise the order is ₂ ^(n) U_(i), R₂, R₁ and ₂ ^(n) U_(i+1). The former order is shown in FIG. 19, and the latter in FIG. 21. Once the order is known, the segments for the edge ₂ ^(n) γ₁ can be identified. For the order ₂ ^(n) U_(i), R₁, R₂ and ₂ ^(n) U_(i+1) the segments are ₂ ^(n) χ₁,1 (₂ ^(n) U_(i), R₁ ; P), ₂ ^(n) χ₁,2 (R_(i), R₂ ; P) and ₂ ^(n) χ₁,3 (R₂, ₂ ^(n) U_(i+1) ; P). For the reverse situation the order of the points is ₂ ^(n) U_(i), R₁, R₂ and ₂ ^(n) U_(i+1) and the three segments are ₂ ^(n) χ₁,1 (₂ ^(n) U_(i), R₂ ; P), ₂ ^(n) χ₁,2 (R₂, R₁ ; P) and ₂ ^(n) χ₁,3 (R₁, ₂ ^(n) U_(i+1) ; P). This can be seen by comparing FIG. 19 and FIG. 21.

Once the segments for an edge are known, the segments that are removed and the segments that remain are determined by using the points ₁ ^(n) U_(i) and ₂ ^(n) U_(i) in the Vertex Inside algorithm (Hoffman, 1987). Consider the point ₁ ^(n) U_(i) shown in FIG. 22. Extend a line ₁ ^(n) Λ_(i) from the point ₁ ^(n) U_(i) through an arbitrarily chosen point Λ_(p1). The equation of the line ₁ ^(n) Λ_(i) in the (x,y) coordinate system is then determined from the points ₁ ^(n) U_(i) and Λ_(p1). The intersections ₁ ^(n) I_(i), i=1,2,3, . . . I_(n) of this line ₁ ^(n) Λ_(i) and all the curves ₂ ^(n) γ_(i), i=1,2,3,4,5, of the intersecting profile ₂ ^(n) S.sub.σ (P), σ=C or I, are then obtained. Note that the intersection of the line ₁ ^(n) Λ_(i) with the edge ₂ ^(n) γ₁ is similar to the combination C₁, and can be determined from equations (4.3a) and (4.3b). Similarly, when the line ₁ ^(n) Λ_(i) intersects a circular arc ₂ ^(n) γ₂, ₂ ^(n) γ₃ or ₂ ^(n) γ₄, the intersection is similar to the combination C₂. When it intersects a quadric curve ₂ ^(n) γ₅, it is similar to the combination C₃. The combinations C₂ and C₃ are explained in the following sections. If the number of intersections ₁ ^(n) I_(i) is odd, then the point ₁ ^(n) U_(i) is inside the intersecting profile ₂ ^(n) S.sub.σ (P); otherwise it is outside. Referring to FIG. 19, it is seen that the point ₁ ^(n) U_(i) is inside the intersecting cavity ₂ ^(n) S_(C) (P), whereas in FIG. 21 the point ₁ ^(n) U_(i) is outside the intersecting cavity. The terminating point ₁ ^(n) U_(i+1) is also evaluated with this algorithm to determine if it is inside or outside the intersecting profile ₂ ^(n) S.sub.σ (P) in the same manner. If both points ₁ ^(n) U_(i) and ₁ ^(n) U_(i+1) are inside the intersecting profile (see FIG. 25), then the segment ₁ ^(n) γ₁ is removed. The method described above for the starting point ₁ ^(n) U_(i) is also applicable to the points ₂ ^(n) U_(i) and ₂ ^(n) U_(i+1) of the edge ₂ ^(n) γ₁.

If the starting point U_(i) of an edge γ₁ is within the intersecting profile, then the odd segments χ₁,1,χ₁,3,χ₁,5, . . . are removed; otherwise the even segments χ₁,2,χ₁,4,χ₁,6, . . . are removed. Referring to FIG. 19, the edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) are subdivided into segments ₁ ^(n) χ₁,1 (U_(i), R₁ ; P) and ₁ ^(n) χ₁,2 (R₁, U_(i+1), P) and into ₂ ^(n) χ₁,1 (U_(i), R₁ ; P), ₂ ^(n) χ₁,2 (R₁, R₂ ; P) and ₂ ^(n) χ₁,3 (R₂, U_(i+1) ; P), respectively. It is known that the point ₁ ^(n) U_(i) is inside the cavity ₂ ^(n) S_(C) (P). Therefore, the odd segment of the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P), that is, ₁ ^(n) χ₁,1 (U_(i), R₁ ; P), is removed and the even segment ₁ ^(n) χ₁,2 (R₁, U_(i+1) ; P) remains. However, the end point ₂ ^(n) U_(i) is outside the cavity ₁ ^(n) S_(C) (P) and, therefore, the even segment of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P), that is, ₂ ^(n) χ₁,2 (R₁, R₂ ; P), is removed. The edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) then become a collection of line segments that are given by

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.1,2 (R.sub.1, U.sub.i+1 ; P)                    (4.5a)

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.1,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.1,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.5b)

However, as shown in FIG. 20, only the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P), which belongs to the island profile ₂ ^(n) S_(I) (P), is considered. In this case the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) is not considered and the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) is given by equation (4.5b).

Referring to FIG. 21, the edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) are subdivided into segments ₁ ^(n) χ₁,1 (U_(i), R₁ ; P) and ₁ ^(n) χ₁,2 (R₁, U_(i+1) ; P) and into ₂ ^(n) χ₁,1 (U_(i), R₂ ; P), ₂ ^(n) χ₁,2 (R₂, R₁ ; P) and ₂ ^(n) χ₁,3 (R₁, U_(i+1) ; P), respectively. It can be seen that the points, ₁ ^(n) U_(i) and ₂ ^(n) U_(i) of the two edges are outside their respective intersecting cavities ₂ ^(n) S_(C) (P) and ₁ ^(n) S_(C) (P). Therefore, the even segment of both edges, ₁ ^(n) χ₁,2 (R₁, U_(i+1) ; P) and ₂ ^(n) χ₁,2 (R₂, R₁ ; P), are removed and the edges are given as the collection of odd segments only. We can, therefore, write that

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.1,1 (U.sub.i, R.sub.1 ; P)                      (4.5c)

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.1,1 (U.sub.i, R.sub.2 ; P)+.sub.2.sup.n χ.sub.1,3 (R.sub.1, U.sub.i+1 ; P)                                            (4.5d)

FIGS. 23 through 26 show some of the ways two edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) may intersect. FIG. 23 shows that both the edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) have only one intersection point R₁ and the points ₁ ^(n) U_(i) and ₂ ^(n) U_(i) are inside the intersecting cavities. These edges are therefore given by

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.1,2 (R.sub.1, U.sub.i+1 ; P)                    (4.5e)

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.1,2 (R.sub.1, U.sub.i+1 ; P)                    (4.5f)

FIG. 24 illustrates that the point ₂ ^(n) U_(i) of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) is inside the intersecting cavity ₁ ^(n) S_(C) (P), whereas the point ₁ ^(n) U_(i) of the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) is outside the intersecting profile ₂ ^(n) S_(C) (P). The edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) has two intersecting points R₁ and R₂ and three segments, whereas the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) has only one intersecting point R₁ and two segments. These edges are thus given by

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.1,1 (U.sub.i, R.sub.1 ; P)+.sub.1.sup.n χ.sub.1,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.5g)

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.1,2 (R.sub.2, U.sub.i+1 ; P)                    (4.5h)

FIG. 25 shows that the edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) do not intersect, however, the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) has both its end points ₁ ^(n) U_(i) and ₁ ^(n) U_(i+1) within the intersecting cavity ₂ ^(n) S_(C) (P). The edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) intersects with other curves of the cavity ₁ ^(n) S_(C) (P) and has two intersection points R₁ and R₂. In this case, the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) is completely removed and the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) is given by

    .sub.2.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.1,1 (U.sub.i, R.sub.2 ; P)+.sub.2.sup.n χ.sub.1,3 (R.sub.1, U.sub.i+1 ; P)                                            (4.5i)

Another combination of C₁ is the case in which the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) is completely removed. This occurs when the two edges ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) coincide with each other as shown in FIG. 26. For this case the matrices ₁ ^(n) Γ_(j) =₂ ^(n) Γ_(j) and the intersection points are R₁ =₁ ^(n) U_(i) and R₂ =₁ ^(n) U_(i+1) which are obtained from intersection of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) with other curves of the cavity ₂ ^(n) S_(C) (P). Thus the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) is also given by equation (4.5i).

It can be seen that there are two classes of intersections for C₁. For the first class the point U_(i) is inside the intersecting cavity and for the second class the point U_(i) is outside the intersecting cavity. Thus two general expressions for these two classes can be written as follows.

A general expression for an edge _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) whose point U_(i) is inside the intersecting profiles and is subdivided into the segments _(v) ^(n) χ₁,i (U_(i-1), U_(i) ; P)i=1,2, . . . , N_(se), is given by ##EQU13## where N_(se) =N_(se) /2 if N_(se) is even and N_(se) =(N_(se) -1)/2 if N_(se) is odd. N_(se) is the number of segments the edge _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) is subdivided into, such that N_(se) =N_(pe+1), where N_(pe) is total number of intersection points for the straight edge. Furthermore, U₀ =U_(i), U_(N).sbsb.se =U_(i+1) and U_(l) =R_(l), l=1,2, . . . N_(pe).

The general expression for an edge _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) whose point U_(i) is outside the intersecting profiles and is subdivided into the segments _(v) ^(n) χ₁,i (U_(i-1), U_(i) ; P), i=1,2, . . . , N_(se), is given by ##EQU14## where N_(se) =N_(se) /2 if N_(se) is even and N_(se) =(N_(se) +1)/2 if N_(se) is odd.

The combination C₂ denotes intersections between a straight edge γ₁ and a second order quadric curve γ₅. The implicit expressions for the straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and a quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) on face n in the (x,y) coordinate system are given by

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=2 .sub.1.sup.n G.sub.j x+2 .sub.1.sup.n H.sub.j y+.sub.1.sup.n K.sub.j =0        (4.7a)

    .sub.2.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n A.sub.j x.sup.2 +.sub.2.sup.n B.sub.j y.sup.2 +2 .sub.2.sup.n D.sub.j xy+2 .sub.2.sup.n G.sub.j x+2 .sub.2.sup.n H.sub.j y+.sub.2.sup.n K.sub.j =0 (4.7b)

We introduce the following parametrization for equation (4.7a):

    x=2 .sub.1.sup.n H.sub.j t+.sub.1.sup.n G.sub.j ζ     (4.8a)

    y=-2 .sub.1.sup.n G.sub.j t+.sub.1.sup.n H.sub.j ζ    (4.8b)

where

    ζ=-.sub.1.sup.n K.sub.j /(2 .sub.1.sup.n G.sub.j.sup.2 +2 .sub.1.sup.n H.sub.j.sup.2)                                            (4.8c)

Substituting equations (4.8a) and (4.8b) into the equation (4.7b) yields the following quadratic equation in t:

    δ.sub.1 t.sup.2 +δ.sub.2 t+δ.sub.3 =0    (4.9)

where,

    δ.sub.1 =4 .sub.2.sup.n A.sub.j 1.sup.n H.sub.j.sup.2 +4 .sub.2.sup.n B.sub.j 1.sup.n G.sub.j.sup.2 -8 .sub.2.sup.n D.sub.j 1.sup.n G.sub.j 1.sup.n H.sub.j

    δ.sub.2 =4 .sub.2.sup.n A.sub.j 1.sup.n G.sub.j 1.sup.n H.sub.j ζ-4 .sub.2.sup.n B.sub.j 1.sup.n G.sub.j 1.sup.n H.sub.j ζ-4 .sub.2.sup.n D.sub.j 1.sup.n G.sub.j.sup.2 ζ-4 .sub.2.sup.n D.sub.j 1.sup.n H.sub.j.sup.2 ζ+4 .sub.2.sup.n G.sub.j 1.sup.n H.sub.j -4 .sub.2.sup.n H.sub.j 1.sup.n G.sub.j

    δ.sub.3 =.sub.2.sup.n A.sub.j 1.sup.n G.sub.j.sup.2 ζ.sup.2 +.sub.2.sup.n B.sub.j 1.sup.n H.sub.j.sup.2 ζ.sup.2 +2 .sub.2.sup.n D.sub.j 1.sup.n G.sub.j 1.sup.n H.sub.j ζ.sup.2 +2 .sub.2.sup.n G.sub.j 1.sup.n G.sub.j ζ+2 .sub.2.sup.n H.sub.j 1.sup.n H.sub.j ζ+.sub.2.sup.n K.sub.j

Solving for t in equation (4.9) gives the values t₁ and t₂. The straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) do not intersect if (δ₂ ² -4δ₁ δ₃)<0. Furthermore, there is only one intersection point if (δ₂ ² -4δ₁ δ₃)=0. When (δ₂ ² -4δ₁ δ₃)>0 the intersection points are R₁ =(x_(q1),y_(q1)) and R₂ =(x_(q2),y_(q2)), where the coordinates (x_(q1),y_(q1)) and (x_(q2),y_(q2)) are obtained by substituting t=t₁ and t=t₂, respectively, into equations (4.8) and (4.8b), provided that 0≦t₁ ≦1 and 0≦t₂ ≦1. If t₁ and t₂ are outside their respective regions the roots are rejected, since such points will not lie between U_(i) and U_(i+1) on the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P).

Referring to FIG. 27, it is seen that an edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) intersects a quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) and generates two intersection points R₁ and R₂. Thus, the edge is segmented into ₁ ^(n) χ₁,1 (U_(i), R₁ ; P), ₁ ^(n) χ₁,2 (R₁, R₂ ; P) and ₁ ^(n) χ₁,3 (R₂, U_(i+1) ; P). Similarly the quadric curve is segmented into ₂ ^(n) χ₅,1 (U_(i), R₁ ; P), ₂ ^(n) χ₅,2 (R₁, R₂ ; P) and ₂ ^(n) χ₅,3 (R₂, U_(i+1) ; P). It can be seen that the point ₁ ^(n) U_(i) of the edge is outside the intersecting cavity ₂ ^(n) S_(C) (P). Similarly the point ₂ ^(n) U_(i) of the quadric curve is outside the intersecting cavity ₁ ^(n) S_(C) (P). This is determined using the Vertex Inside algorithm described in the previous section. Hence, the straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) are given by, respectively,

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.1,1 (U.sub.i, R.sub.1 ; P)+.sub.1.sup.n χ.sub.1,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.10a)

    .sub.2.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.5,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.5,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.10b)

A general expression for a straight edge _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) that is subdivided into segments _(v) ^(n) χ₁,i (U_(i-1), U_(i) ; P), i=1,2, . . . , N_(se), is given by equation (4.6). It can be seen that there are two classes of intersections for C₂. For the first class the point U_(i) of the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) is inside the intersecting cavity, and for the second class the point U_(i) of the quadric curve is outside the intersecting cavity. These two general expressions for these two classes can be written as follows.

A general expression for a quadric curve _(v) ^(n) γ₅ (U_(i), U_(i+1) ; P), whose point U_(i) is inside the intersecting profiles and is subdivided into the segments _(v) ^(n) χ₅,1 (U_(i-1), U_(i) ; P), i=1,2, . . . , N_(sq), is given by ##EQU15## where N_(sq) =N_(sq) /2 if N_(sq) is even and N_(sq) =(N_(sq) -1)/2 if N_(sq) is odd. N_(sq) is the number of segments the quadric curve _(v) ^(n) γ₅ (U_(i), U_(i+1) ; P) is subdivided into, such that N_(sq) =N_(pq+1), where N_(pq) is total number of intersection points for the quadric curve. Furthermore, U₀ =U_(i), U_(N).sbsb.sq =U_(i+1) and U_(l) =R_(l), l=1,2, . . . N_(pq).

The general expression for a quadric curve _(v) ^(n) γ₅ (U_(i), U_(i+1) ; P), whose point U_(i) is outside the intersecting profiles and is subdivided into the segments _(v) ^(n) χ₅,i (U_(i-1), U_(i) ; P), i=1,2, . . . N_(sq), is given by ##EQU16## where N_(sq) =N_(sq) /2 if N_(sq) is even and N_(sq) =(N_(sq) +1) if N_(sq) is odd.

The special case when the straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) is tangential to the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) is shown in FIG. 28. In this case R₁ =R₂ and equation (4.11) still holds; however, the segment ₂ ^(n) χ₅,2 (R₁, R₂ ; P) is removed from equation (4.11).

The combination C₃ denotes intersections between a straight edge γ₁ and one of the circular arcs γ_(k+1), k=1,2,3. The combination C₃ is treated similarly to the combination C₂ discussed above. The implicit expressions for the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and a circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), k=1,2,3 on face n in the (x,y) coordinate system are given by

    .sub.1.sup.n γ.sub.1 (U.sub.i, U.sub.i+1 ; P)=2 .sub.1.sup.n G.sub.j x+2 .sub.1.sup.n H.sub.j y+.sub.1.sup.n K.sub.j =0        (4.12a)

    .sub.2.sup.n γ.sub.k+1 (U.sub.i, U.sub.i+1 ; P)=x.sup.2 +y.sup.2 +2 .sub.2.sup.n G.sub.jk x+2 .sub.2.sup.n H.sub.jk y+.sub.2.sup.n K.sub.jk =0 (4.12b)

Substituting the equations (4.8a) and (4.8b) into equation (4.12b), results in equation (4.9) where now δ₁, δ₂ and δ₃ are given by

    δ.sub.1 =4 .sub.1.sup.n H.sub.j.sup.2 +4 .sub.1.sup.n G.sub.j.sup.2

    δ.sub.2 =4 .sub.2.sup.n G.sub.jk 1.sup.n H.sub.j -4 .sub.2.sup.n H.sub.jk 1.sup.n G.sub.j

    δ.sub.3 =.sub.1.sup.n G.sub.j.sup.2 ζ.sup.2 +.sub.1.sup.n H.sub.j.sup.2 ζ.sup.2 +2 .sub.2.sup.n G.sub.jk 1.sup.n G.sub.j ζ+2 .sub.2.sup.n H.sub.jk 1.sup.n H.sub.j ζ+.sub.2.sup.n K.sub.jk

Solving for t in equation (4.9) yields the roots t₁ and t₂. The straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) and the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), k=1,2,3, do not intersect if (δ₂ ² -4δ₁ δ₃)<0. Furthermore, there is only one intersection point if (δ₂ ² -4δ₁ δ₃)=0. When (δ₂ ² -4δ₁ δ₃)>0 the intersection points are R₁ =(x_(g1),y_(g1)) and R₂ =(x_(g2),y_(g2)), where the coordinates (x_(g1),y_(g1)) and (x_(g2),y_(g2)) are obtained by substituting t=t₁ and t=t₂, respectively, into equations (4.8a) and (4.8b), provided 0≦t₁ ≦1 and 0≦t₂ ≦1. If t₁ and t₂ are outside their respective regions the roots are rejected, since such points will not lie between U_(i) and U_(i+1) on the edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P).

A general expression for a straight edge ₁ ^(n) γ₁ (U_(i), U_(i+1) ; P) that is subdivided into segments _(v) ^(n) χ₁,i (U_(i-1), U_(i) ; P), i=1,2, . . . , N_(se), is given by equation (4.6). It can be seen that there are two classes of intersections for C₃. For the first class the point U_(i) of one of the circular arcs ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) is inside the intersecting cavity, and for the second class the point U_(i) is outside the intersecting cavity. Thus two general expressions for the above two classes can be written as follows.

A general expression for a circular arc _(v) ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), whose point U_(i) is inside the intersecting profile and is subdivided into the segments _(v) ^(n) χ_(k+1),i (U_(i-1), U_(i), P), i=1,2, . . . , N_(sq), is given by ##EQU17## where N_(sg) =N_(sg) /2 if N_(sg) is even and N_(sg) =(N_(sg) -1)/2 if N_(sg) is odd. N_(sg) is the number of segments the circular arc _(v) ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) is subdivided into, such that N_(sg) =N_(pg+1), where N_(pg) is total number of intersection points for the circular arc. Furthermore, U₀ =U_(i), U_(N).sbsb.sg =U_(i+1) and U_(l) =R_(l), l=1,2, . . . N_(pg).

The general expression for a circular arc _(v) ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), whose point U_(i) is outside the intersecting profiles and is subdivided into the segments _(v) ^(n) χ_(k+1),i (U_(i-1), U_(i) ; P), i=1,2, . . . , N_(sg), is given by ##EQU18## where N_(sg) =N_(sg) /2 if N_(sg) is even and N_(sg) =(N_(sg) +1)/2 if N_(sg) is odd.

The combination C₄ denotes the intersections of a quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) with one of the circular arcs ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), k=1,2,3. To determine whether or not these two curves intersect we use Sylvester's determinant. The implicit forms for the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) are given by, respectively,

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n B.sub.j y.sup.2 +[2 .sub.1.sup.n D.sub.j x+2 .sub.1.sup.n H.sub.j ]y+[.sub.1.sup.n A.sub.j x.sup.2 +2 .sub.1.sup.n G.sub.j x+.sub.1.sup.n K.sub.j ]=0 (4.14a)

    .sub.2.sup.n γ.sub.k+1 (U.sub.i, U.sub.i+1 ; P)=y.sup.2 +2 .sub.2.sup.n H.sub.jk y+[x.sup.2 +2 .sub.2.sup.n G.sub.jk x+.sub.2.sup.n K.sub.jk ]=0                                              (4.14b)

The determinant of Sylvester's matrix [Hoffman,1989] for the above equations is ##EQU19## The determinant |R_(x) |₄ vanishes when the two polynomials given by equations (4.14a) and (4.14b) have common roots; that is, when the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) intersects the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P).

The coordinates of the point U_(i) are (x_(i),y_(i)) and that of point U_(i+1) are (x_(i+1),y_(i+1)) in the (x,y) system. The value of |R_(x) |₄ given by equation (4.15) is calculated at x=x_(i) and its sign is noted. Then x is increased by a small value and the value of |R_(x) |₄ is again calculated. Any change in sign of the determinant |R_(x) |₄ indicates that R_(x) is singular between the last value of x and the new value of x. When this is the case these two values of x are stored for use later to find the roots more exactly. If there is no sign change, x is incremented and the comparison process is repeated until the maximum value x=x_(i+1) is reached. If there is no change in sign of |R_(x) |₄ throughout the range, then the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) does not intersect the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P). Each intersection for combination C₄ yields up to four intersection points R_(l), l=1,2,3,4. After the range of x has been evaluated all the intervals that indicated a sign change are re-evaluated using a standard numerical root finding procedure to determine the intersection points from equations (4.14a) and (4.14b).

FIG. 29 shows that the intersection of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) with one of the circular arcs ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) results in two intersection points, R₁ and R₂. FIG. 31 shows, however, a case where there are four intersection points. It should be realized that the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) may intersect other curves ₂ ^(n) γ_(i) of the cavity profile ₂ ^(n) S_(C) (P), and that these intersections may yield an additional N_(p1) -R_(l) intersection points. Similarly, the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) may intersect other curves ₁ ^(n) γ_(i), i=1,2,3,4, and may have an additional N_(p2) -R_(l) intersection points. This is illustrated in FIG. 30 where R₂ results from the intersection of the circular arc with another curve of the cavity profile ₁ ^(n) S_(C) (P).

The point ₁ ^(n) U_(i) of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and the point ₂ ^(n) U_(i) of the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) are evaluated using the Vertex Inside algorithm to determine whether or not they are inside their respective intersecting profiles. If the point U_(i) of either the quadric curve γ₅ or the circular arc γ_(k+1) is within the intersecting profiles, then the odd segments χ₁,1, χ₁,3, χ₁,5, . . . are removed, otherwise the even segments χ₁,2, χ₁,4, χ₁,6, . . . are removed. Referring to FIG. 29, the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) are subdivided into segments ₁ ^(n) χ₅,1 (U_(i), R₂ ; P), ₁ ^(n) χ₅,2 (R₂, R₁ ; P) and ₁ ^(n) χ₅,3 (R₁, U_(i+1) ; P), and ₂ ^(n) χ_(k+1),1 (U_(i), R₁ ; P), ₂ ^(n) χ_(k+1),2 (R₁, R₂ ; P) and ₂ ^(n) χ_(k+1),3 (R₂, U_(i+1) ; P), respectively. The point ₁ ^(n) U_(i) of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₂ ^(n) S_(C) (P). Therefore, the even segments of the quadric curve, that is, ₁ ^(n) χ₅,2 (R₂, R₁ ; P) is removed. Similarly, the point ₂ ^(n) U_(i) of the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₁ ^(n) S_(C) (P). Therefore, the even segments of the circular arc, that is, ₂ ^(n) χ_(k+1),2 (R₁, R₂ ; P) is removed. The quadric curve and the circular arcs are then given by, respectively,

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.5,1 (U.sub.i, R.sub.2 ; P)+.sub.1.sup.n χ.sub.5,3 (R.sub.1, U.sub.i+1 ; P)                                            (4.16a)

    .sub.2.sup.n γ.sub.k+1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.k+1,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.k+1,3 (R.sub.2, U.sub.i+1 ; P) k=1,2,3                          (4.16b)

Referring to FIG. 30, the point ₁ ^(n) U_(i) of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is inside the intersecting cavity ₂ ^(n) S_(C) (P) and the point ₂ ^(n) U_(i) of the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₁ ^(n) S_(C) (P). The quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) are then given by, respectively,

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.5,2 (R.sub.1, U.sub.i+1 ; P)                    (4.16c)

    .sub.2.sup.n γ.sub.k+1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.k+1,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.k+1,3 (R.sub.2, U.sub.i+1 ; P) k=1,2,3                          (4.16d)

FIG. 31 shows that there are four intersection points R_(l), l=1,2,3,4. The point ₁ ^(n) U_(i) of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₂ ^(n) S_(C) (P). The quadric curve is divided into five segments ₁ ^(n) χ₅,1 (U_(i), R₃ ; P), ₁ ^(n) χ₅,2 (R₃, R₁ ; P), ₁ ^(n) χ₅,3 (R₁, R₂ ; P), ₁ ^(n) χ₅,4 (R₂, R₄ ; P) and ₁ ^(n) χ₅,5 (R₄, U_(i+1) ; P). The circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) has its point ₂ ^(n) U_(i) inside the intersecting cavity ₁ ^(n) S_(C) (P) and is divided into the segments ₂ ^(n) χ_(k+1),1 (U_(i), R₃ ; P), ₂ ^(n) χ_(k+1),2 (R₃, R₂ ; P), ₂ ^(n) χ_(k+1),3 (R₁, R₂ ; P), ₂ ^(n) χ_(k+1),4 (R₂, R₄ ; P) and ₂ ^(n) χ_(k+1),5 (R₄, U_(i+1) ; P). It can be seen that both the points, ₂ ^(n) U_(i) and ₂ ^(n) U_(i+1), of the circular arc are inside the intersecting cavity ₁ ^(n) S_(C) (P). This is a similar to the straight edge shown in FIG. 25, where the edge is completely removed because both of its end points are inside the intersecting cavity. However, in this case the circular arc is not removed because it satisfies the condition ₂ ^(n) U_(i) =₂ ^(n) U_(i+1).The quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) are then given by, respectively,

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.5,1 (U.sub.i, R.sub.1 ; P)+.sub.1.sup.n χ.sub.5,3 (R.sub.1, R.sub.2 ; P)+.sub.1.sup.n χ.sub.5,5 (R.sub.4, U.sub.i+1 ; P) (4.16e)

    .sub.2.sup.n γ.sub.k+1 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.k+1,2 (R.sub.3, R.sub.1 ; P)+.sub.2.sup.n χ.sub.k+1,4 (R.sub.2, R.sub.4 ; P) k=1,2,3                            (4.16f)

FIGS. 32 through 34 show three special cases of combination C₄. FIG. 32 shows the case when the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is tangential to one of the circular arcs ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) and, therefore, R₁ =R₂. To detect this case, the common tangent to both curves at R₁ is calculated. If a common tangent found, it is assumed that there are no intersection points. In FIG. 33 the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) coincides with the circular arc ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P). In this case ₁ ^(n) Γ₅ =₂ ^(n) Γ_(k+1), and it is assumed that R₁ =₁ ^(n) U_(i) and R₂ =₁ ^(n) U_(i+1). FIG. 34 shows the case where the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is completely surrounded by the intersecting cavity ₂ ^(n) S_(C) (P). In this case there are no intersections. However, the two points ₁ ^(n) U_(i) and ₁ ^(n) U_(i+1) are within the intersecting cavity ₂ ^(n) S_(C) (P). The quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is removed when both of its end points are within the intersecting profile.

The combination C₅ denotes the intersection of two circular arcs ₁ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P) and ₂ ^(n) γ_(k+1) (U_(i), U_(i+1) ; P), k=1,2,3. To determine whether or not these two curves intersect we use Sylvester's determinant. The implicit forms for the two arcs ₁ ^(n) γ₂ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₃ (U_(i), U_(i+1) ; P) are, respectively,

    .sub.1.sup.n γ.sub.2 (U.sub.i, U.sub.i+1 ; P)=y.sup.2 +2 .sub.1.sup.n H.sub.jk y+[x.sup.2 +2 .sub.1.sup.n G.sub.jk x+.sub.1.sup.n K.sub.jk ]=0 (4.17a)

    .sub.2.sup.n γ.sub.3 (U.sub.i, U.sub.i+1 ; P)=y.sup.2 +2 .sub.2.sup.n H.sub.jk y+[x.sup.2 +2 .sub.2.sup.n G.sub.jk x+.sub.2.sup.n K.sub.jk ]=0 (4.17b)

The determinant of Sylvester's matrix for the above equations is ##EQU20## The determinant |R_(x) |₅ vanishes when the two polynomials given by equations (4.17a) and (4.17b) have common roots: that is, when the circular arc ₁ ^(n) γ₂ (U_(i), U_(i+1) ; P) intersects the circular arc ₂ ^(n) γ₃ (U_(i), U_(i+1) ; P).

Each intersection for combination C₅ yields up to four intersection points R_(l), l=1,2,3,4. These intersection points are found in the same manner as those corresponding to combination C₄.

FIG. 35 shows the intersection of two circular arcs ₁ ^(n) γ₂ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₃ (U_(i), U_(i+1) ; P), which yields the two intersection points, R₁ and R₂.

The points ₁ ^(n) U_(i) and ₂ ^(n) U_(i) of the two respective circular arcs are evaluated using the Vertex Inside algorithmto determine whether or not they are inside of their respective intersecting profiles. If the point U_(i) of either arc is within the intersecting profile, then the odd segments χ₁,1, χ₁,3, χ₁,5, . . . are removed; otherwise, the even segments χ₁,2, χ₁,4, 1°₁,6, . . . are removed. Referring to FIG. 35, the circular arc ₁ ^(n) γ₂ (U_(i), U_(i+1) ; P) is subdivided into segments ₁ ^(n) χ₂,1 (U_(i), R₂ ; P), ₁ ^(n) χ₂,2 (R₂, R₁ ; P) and ₁ ^(n) χ₂,3 (R₁, U_(i+1) ; P) and the circular arc ₂ ^(n) γ₃ (U_(i), U_(i+1) ; P) is subdivided into the segments ₂ ^(n) χ₃,1 (U_(i), R₁ ; P), ₂ ^(n) χ₃,2 (R₁, R₂ ; P) and ₂ ^(n) χ₃,3 (R₂, U_(i+1) ; P). The points ₁ ^(n) U_(i) of the arc ₁ ^(n) γ₂ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₂ ^(n) S_(C) (P). Therefore, the even segment of the arc ₁ ^(n) χ₂,2 (R₂, R₁ ; P) is removed. Similarly, the starting end point ₂ ^(n) U_(i) of the circular arc ₂ ^(n) γ₃ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₁ ^(n) S_(C) (P). Therefore, the even segment of the circular arc ₂ ^(n) χ₃,2 (R₁, R₂ ; P) is removed. The segmented arcs are then given by

    .sub.1.sup.n γ.sub.2 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.2,1 (U.sub.i, R.sub.2 ; P)+.sub.1.sup.n χ.sub.2,3 (R.sub.1, U.sub.i+1 ; P)                                            (4.19a)

    .sub.2.sup.n γ.sub.3 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.3,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.3,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.19b)

The combination C₆ denotes the intersections of two quadric curves. To determine whether or not these two curves intersect we use Sylvester's determinant. The implicit forms for the two quadric curves ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) are, respectively,

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n B.sub.j y.sup.2 +]2 .sub.1.sup.n D.sub.j x+2 .sub.1.sup.n H.sub.j ]y+[.sub.1.sup.n A.sub.j x.sup.2 +2 .sub.1.sup.n G.sub.j x+.sub.1.sup.n K.sub.j ]=0 (4.20a)

    .sub.2.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n B.sub.j y.sup.2 +[2 .sub.2.sup.n D.sub.j x+2 .sub.2.sup.n H.sub.j ]y+[.sub.2.sup.n A.sub.j x.sup.2 +2 .sub.2.sup.n G.sub.j x+.sub.2.sup.n K.sub.j ]=0 (4.20b)

The determinant of Sylvester's matrix for the above equations is ##EQU21## The determinant |R_(x) |₆ vanishes when the two polynomials given by equations (4.20a) and (4.20b) have common roots; that is, when the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) intersects the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P). The determinant |R_(x) |₆ is used in the same manner as |R_(x) |₄ and |R_(x) |₅ were used for combinations C₄ and C₅, respectively.

Each intersection for combination C₆ yields up to four intersection points R_(l), l=1,2,3,4. These intersection points are found in the same manner as those corresponding to combination C₄.

FIG. 36 shows the intersection of two quadric curves ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) which yields the two intersection points, R₁ and R₂.

The points ₁ ^(n) U_(i) and ₂ ^(n) U_(i) of the two respective quadric curves are evaluated using the Vertex Inside algorithm to determine whether or not they are inside of their respective intersecting profiles. If the point U_(i) of either quadric curve is within the intersecting profile, then the odd segments χ₁,1, χ₁,3, χ₁,5, . . . are removed; otherwise, the even segments χ₁,2, χ₁,4, χ₁,6, . . . are removed. Referring to FIG. 36, the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is subdivided into segments ₁ ^(n) χ₅,1 (U_(i), R₂ ; P), ₁ ^(n) χ₅,2 (R₂, R₁ ; P) and ₁ ^(n) χ₅,3 (R₁, U_(i+1) ; P) and the other quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) is subdivided into the segments ₂ ^(n) χ₅,1 (U_(i), R₁ ; P), ₂ ^(n) χ₅,2 (R₁, R₂ ; P) and ₂ ^(n) χ₅,3 (R₂, U_(i+1) ; P). The points ₁ ^(n) U_(i) of the quadric curve ₁ ^(n) γ₅ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₂ ^(n) S_(C) (P). Therefore, the even segment of the curve ₁ ^(n) χ₅,2 (R₂, R₁ ; P) is removed. Similarly, the point ₂ ^(n) U_(i) of the quadric curve ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) is outside the intersecting cavity ₁ ^(n) S_(C) (P). Therefore, the even segment of the curve ₂ ^(n) χ₅,2 (R₁, R₂ ; P) is removed. The segmented curves are then given by

    .sub.1.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.1.sup.n χ.sub.5,1 (U.sub.i, R.sub.2 ; P)+.sub.1.sup.n χ.sub.5,3 (R.sub.1, U.sub.i+1 ; P)                                            (4.22a)

    .sub.2.sup.n γ.sub.5 (U.sub.i, U.sub.i+1 ; P)=.sub.2.sup.n χ.sub.5,1 (U.sub.i, R.sub.1 ; P)+.sub.2.sup.n χ.sub.5,3 (R.sub.2, U.sub.i+1 ; P)                                            (4.22b)

As previously stated, there are three situations that have to be considered; either (a) the extents of profiles F.sub.α and F.sub.β do not overlap with each other (denoted Ω₁), (b) the extents F.sub.α and F.sub.β overlap but the profiles .sub.α^(n) S_(C) (P) and .sub.β^(n) S_(C) (P) do not intersect (denoted Ω₂) or (c) the two extents F.sub.α and F.sub.β overlap and the profiles .sub.α^(n) S_(C) (P) and .sub.β^(n) S_(C) (P) intersect (denoted Ω₃). The resulting profiles of case (a) are then given by equation (18). This case will not be discussed further. However, when two extents F.sub.α and F.sub.β overlap each other they are surrounded by another extent F.sub.ω such that the two profiles .sub.α^(n) S_(C) (P) and .sub.β^(n) S_(C) (P) are contained in the new extent F.sub.ω. The new extent F.sub.ω forms a new entity (FMEM).sub.ω. The resulting profiles for cases (b) and (c) are now discussed.

Consider the case when the two profiles .sub.α^(n) S_(C) (P) and .sub.β^(n) S_(C) (P) do not intersect (Ω₂) in F.sub.ω. In the most general case, the newly formed profile .sub.Ω.sbsb.2^(n) S_(F) (P), is given by

    .sub.Ω.sbsb.2.sup.n S.sub.F (P)=.sub.α.sup.n S.sub.I (P)+.sub.α.sup.n S.sub.C (P)+.sub.β.sup.n S.sub.I (P)+.sub.β.sup.n S.sub.C (P) n=1, . . . , 6          (4.23)

where the profiles .sub.α^(n) S_(I) (P) and .sub.α^(n) S_(C) (P) represent an island and its surrounding cavity, respectively, of (FMEM).sub.α, and the profiles .sub.β^(n) S_(I) (P) and .sub.β^(n) S_(C) (P) represent an island and its surrounding cavity, respectively, of (FMEM).sub.β. Each of these profiles is given by the appropriate implementation of equation (3.19). The subscript F denotes that the resulting profile defines a profile and Ω₂ indicates that none of the profiles in F.sub.ω intersects.

There are three combinations of profile intersections on a face n. The first combination is when a cavity .sub.α^(n) S_(C) (P) intersects another cavity .sub.β^(n) S_(C) (P), and the second case is when a cavity .sub.α^(n) S_(C) (P) intersects an island .sub.β^(n) S_(I) (P). However, an island does not exist without a surrounding cavity, therefore, the intersection of an island with another cavity cannot be described without also considering the intersection of its surrounding cavity. The case of an island .sub.α^(n) S_(I) (P) intersecting another island .sub.β^(n) S_(I) (P) is not physically realizable. Mathematically, the case of an island .sub.α^(n) S_(I) (P) intersecting a cavity .sub.β^(n) S_(C) (P) and the case of a cavity .sub.α^(n) S_(C) (P) intersecting an island .sub.β^(n) S_(I) (P) are the same.

Referring to FIG. 37, the first combination of profile intersections is when a cavity .sub.α^(n) S_(C) (P) intersects another cavity .sub.β^(n) S_(C) (P). The two intersecting cavity profiles form a new cavity .sub.ω^(n) S_(CC) (P). The two island profiles .sub.α^(n) S_(I) (P) and .sub.β^(n) S_(I) (P) are intact and are given in their general form by equation (3.18). The resultant profile .sub.Ω.sbsb.3^(n) S_(F) (P) is then

    .sub.Ω.sbsb.3.sup.n S.sub.F (P)=.sub.ω.sup.n S.sub.CC (P)+.sub.α.sup.n S.sub.I (P)+.sub.β.sup.n S.sub.I (P) n=1, . . . , 6                                                     (4.24)

As will be shown in FIG. 41, it is possible for Ω₃ intersections to form an island .sub.ω^(n) S_(I) (P).

Referring to FIG. 38, the second combination of profile intersections is when a cavity profile .sub.β^(n) S_(C) (P) intersects the cavity profile .sub.α^(n) S_(C) (P) as well as the island profile .sub.α^(n) S_(I) (P). The two intersecting cavity profiles again form a new cavity .sub.ω^(n) S_(CC) (P). The modification to the island profile .sub.α^(n) S_(I) (P) is denoted .sub.α^(n) S_(I) (P). The island profile .sub.β^(n) S_(I) (P) is not affected. The resultant profile .sub.Ω.sbsb.3^(n) S_(F) (P) is then

    .sub.Ω.sbsb.3.sup.n S.sub.F (P)=.sub.ω.sup.n S.sub.CC (P)+.sub.α.sup.n S.sub.I (P)+.sub.β.sup.n S.sub.I (P) n=1, . . . , 6                                                     (4.25)

As shown in FIG. 39, the last combination of intersecting profiles again modifies the two cavity profiles .sub.α^(n) S_(C) (P) and .sub.β^(n) S_(C) (P) to form a new cavity .sub.ω^(n) S_(CC) (P). The two island profiles .sub.α^(n) S_(I) (P) and .sub.β^(n) S_(I) (P) are modified to .sub.α^(n) S_(I) (P) and .sub.β^(n) S_(I) (P), respectively. The resultant profile .sub.Ω.sbsb.3^(n) S_(F) (P) is then

    .sub.Ω.sbsb.3.sup.n S.sub.F (P)=.sub.ω.sup.n S.sub.CC (P)+.sub.α.sup.n S.sub.I (P)+.sub.β.sup.n S.sub.I (P) n=1, . . . , 6                                                     (4.26)

The modified island profiles .sub.α^(n) S_(I) (P) and .sub.β^(n) S_(I) (P) are determined in the manner indicated in Sections 4.2.1 through 4.2.6.

The preceding results will now be illustrated for a very general case. Consider FIG. 40 where a cavity profile ₁ ^(n) S_(C) (P) intersects another cavity profile ₂ ^(n) S_(C) (P); that is, an Ω₃ intersection. FIG. 41 shows an enlarged view of the region F. It can be seen that six curves of profile ₁ ^(n) S_(C) (P), ₁ ^(n) q₁, ₁ ^(n) g₁,k, k=1,2,3, ₁ ^(n) e₁ and ₁ ^(n) q₄, lie totally or partially within the region F. Similarly, there are seven curves of profile ₂ ^(n) S_(C) (P), ₂ ^(n) q₂, ₂ ^(n) g₃,k, k=1,3, ₂ ^(n) e₃, ₂ ^(n) q₃ and ₂ ^(n) g₄,1, that lie totally or partially within the region F, for a total of 13 curves in this region. It is also seen that both the end points of the edge ₁ ^(n) e₁ and the quadric curve ₂ ^(n) q₃ are inside the profiles ₂ ^(n) S_(C) (P) and ₁ ^(n) S_(C) (P), respectively. Hence, they are removed from the resulting profile .sub.Ω.sbsb.3^(n) S_(F) (P). In region F, only three pairs of curves intersect each other: ₁ ^(n) g₁,1 intersects ₂ ^(n) e₃ at R₂, ₁ ^(n) g₁,3 intersects ₂ ^(n) g₃,2 at R₃ and R₄, and ₁ ^(n) q₄ intersects ₂ ^(n) g₄,1 at R₁. These three intersections form the combination types C₃, C₆ and C₄, respectively.

The remainder of the curves in ₁ ^(n) S_(C) (P), denoted ₁ ^(n) S_(C) (P), and in ₂ ^(n) S_(C) (P)), denoted ₂ ^(n) S_(C) (P), are not affected by the intersection. The new cavity that is formed, ₃ ^(n) S_(CC) (P), therefore, is given by

    .sub.3.sup.n S.sub.CC (P)=.sub.1.sup.n S.sub.C (P)+.sub.2.sup.n S.sub.C (P)+.sub.1.sup.n g.sub.1,3 (R.sub.4, P.sub.1,5)+.sub.1.sup.n q.sub.1 (P.sub.1,5, P.sub.2,1)+.sub.1.sup.n q.sub.4 (P.sub.4,6, R.sub.1)+.sub.2.sup.n g.sub.1,3 (P.sub.3,2, P.sub.3,3)+.sub.2.sup.n g.sub.3,2 (P.sub.3,3, R.sub.4)+.sub.2.sup.n q.sub.2 (P.sub.2,6, P.sub.3,1)+.sub.2.sup.n g.sub.4,1 (R.sub.1, P.sub.4,3)    (4.27)

Finally, it is noted that an island has been created by this intersection, and its profile is given by

    .sub.3.sup.n S.sub.I (P)=.sub.1.sup.n g.sub.1,1 (R.sub.2, P.sub.1,3)+.sub.1.sup.n g.sub.1,2 (P.sub.1,3, P.sub.1,4)+.sub.1.sup.n g.sub.1,3 (P.sub.1,4, R.sub.3)+.sub.2.sup.n g.sub.3,2 (R.sub.3, P.sub.3,4)+.sub.2.sup.n g.sub.3,3 (P.sub.3,4,P.sub.3,5)+.sub.2.sup.n e.sub.3 (P.sub.3,5, R.sub.2)                              (4.28)

Using equation (4.27) and (4.28) the resultant profile is

    .sub.Ω.sbsb.3.sup.n S.sub.F (P)=.sub.3.sup.n S.sub.CC (P)+.sub.3.sup.n S.sub.I (P)                              (4.29)

The treatment of multi-profile intersections on a common surface is based on the two-profile intersection procedure explained above. The process of determining the properties of a two-profile intersection on a surface consists of five steps. The first step is to determine whether or not the two extents overlap. Once it has been established that the two extents overlap, the second step is to determine whether or not any of the curves of the two profiles that lie within the overlapped region intersect. If they intersect, the points R_(l), l=1, . . . , are determined. The third step is to order the intersection points R_(l) along each curve. The fourth step is to define the segments of each curve and determine which of the segments remain and which are removed. The fifth step is to arrange the segments and produce the final profile.

When three or more profiles are involved, only a pair of profiles, .sub.α^(n) S.sub.σ (P) and .sub.β^(n) S.sub.σ (P), are considered at one time. Referring to FIG. 42, we see that there are three situations that have to be considered; either (a) the extents of profiles F.sub.α and F.sub.β do not overlap with each other (Ω₁); (b) the extents F.sub.α and F.sub.β overlap but the profiles .sub.α^(n) S.sub.σ (P) and .sub.β^(n) S.sub.σ (P) do not intersect (Ω₂); or (c) the two extents F.sub.α and F.sub.β overlap and the profiles .sub.α^(n) S.sub.σ (P) and .sub.β^(n) S.sub.σ (P) intersect (Ω₃). The resulting profiles of cases (a) and (b) are given by equations (3.18) and (4.23), respectively. For case (c), the two-profile intersection procedure is used. However, only the first two steps of the procedure are carried out, with the other three steps performed after the intersection points for all the intersecting profiles are known.

Referring to FIG. 42, there are five extents F₁, . . . , F₅ enclosed in a main extent F_(m). The extent F₂ has an Ω₁ relationship with extents F₃ and F₅. Also extents F₁ and F₅ have an Ω₁ relationship. The extents F₄ and F₅, however, form an Ω₂ relationship, that is, the two extents overlap, but the profiles contained in them do not intersect. (This is an assumption for purpose of this example.) The extent F₁ is assumed to form an Ω₃ relationship with extents F₂ and F₄ ; that is, the profile contained in F₁ intersects the profiles contained in F₂ and F₄ within the region F₁₂ and F₁₄, respectively. Similarly, the profiles in F₃ and F₅ are assumed to intersect within the region F₃₅, and the extents F₂ and F₄ are assumed to intersect within the region F₂₄. Within F₂₄ there are three intersecting profiles; however, the intersection within this region is evaluated by sequentially applying the two-profile intersection procedure in regions F₁₂, F₂₄ and F₁₄. Once the intersections of the two profiles ₁ ^(n) S.sub.σ (P) and ₂ ^(n) S.sub.σ (P) are known, the intersection of the third profile ₄ ^(n) S.sub.σ (P) with these two profiles is determined. The intersection points for all three sets of intersections are then stored, and the intersection points are evaluated using the Vertex Inside algorithm to determine whether or not they lie inside the cavity. The points that are found to be inside the cavity are deleted. The remaining intersection points are ordered on their respective curves and the segments of each curve are determined. Then the segments that are to be removed and the segments that are to remain are determined. The final profile for all intersecting profiles is then determined.

Consider a main extent F_(m) that encloses N_(f),m profiles and N_(e),m overlapped extents. Each of these extents contains a profile within it. Let there be N.sub.Ω.sbsb.2 profiles that have an Ω₂ realtionship with each other in F_(m). A general expression of the resulting profile is given by ##EQU22##

Let there are N.sub.Ω.sbsb.2 profiles that have an Ω₃ realtionship with each other in F_(m). A general expression of the resulting profiles within F_(m) is given by ##EQU23## where _(v) ^(n) S_(I) (P)=_(v) ^(n) S_(I) (P) if an island is not intersected by a cavity. The general expression for the final profile is then given by ##EQU24## where N.sub.Ω.sbsb.1 =N_(f),m -N.sub.Ω.sbsb.2 -N.sub.Ω.sbsb.3.

In order to determine the intersection of two or more profiles on the same plane, it is first necessary to determine if their respective extents overlap. A method is presented that determines whether or not the extents overlap, and if they overlap what that overlapped region is. This method is based on a standard clipping procedure (Foley, 1987).

Consider two extents F.sub.α and F.sub.β as shown in FIG. 43. The four corners of each extent are denoted bottom right, BR, bottom left, BL, top right, TR and top left, TL. The diagonals D₁ and D₂ of these extents are defined such that D₁ connects a BR corner to a TL corner of one extent and D₂ joins a BL corner to a TR corner of the other extent. The method requires that if diagonal D₁ is taken for the extent F.sub.α, then diagonal D₂ must be used for extent F.sub.β. On the other hand, if D₂ is used for the first extent, then D₁ must be used for the second extent. In FIG. 43 diagonal D₁ is used by extent F.sub.α and diagonal D₂ is used by extent F.sub.β. The equations for the diagonals D₁ and D₂ in the global coordinate system (X,Y,Z) are given by, respectively,

    (X.sub.lα -X.sub.rα)Y+(Y.sub.bα -Y.sub.tα)X+(X.sub.rα Y.sub.tα -X.sub.lα Y.sub.bα)=0                                         (4.33a)

    (X.sub.rβ -X.sub.lβ)Y+(Y.sub.bβ -Y.sub.tβ)X+(X.sub.lβ Y.sub.tβ -X.sub.rβ Y.sub.bβ)=0                                          (4.33b)

where, (X_(r)γ,Y_(b)γ) and (X_(l)γ, Y_(t)γ) are the global coordinates of the points BR and TL, respectively, and γ=α, β. The subscript α is used to indicate that diagonal D₁ belongs to F.sub.α, and correspondingly, β is used to indicate that D₂ belongs to F.sub.β. It can be seen that the two horizontal sides of an extent are given by Y=Y_(b)γ, and Y=Y_(t)γ, respectively, and the two vertical sides are given by X=X_(r)γ and X=X_(l)γ, respectively.

To determine if extent F.sub.α overlaps extent F.sub.β, we determine whether or not D₁ intersects any of the four sides of F.sub.β, and whether or not D₂ intersects any of the four sides of F.sub.α. The equations of the four sides of the extent F.sub.β are given by

    X=X.sub.rβ                                            (4.34a)

    X=X.sub.lβ                                            (4.34b)

    Y=Y.sub.bβ                                            (4.34c)

    Y=Y.sub.tβ                                            (4.34d)

First, equation (4.34a) is substituted into equation (4.33a) and the resulting equation is solved to get Y=Y₁. If Y_(b)β ≦Y₁ ≦Y_(t)β, then the diagonal D₁ intersects the right vertical side of the extent F.sub.β and the coordinates of the BR and TL corners of the overlapped region F are (X_(r)β, Y₁) and (X_(l)α, Y_(t)α), respectively. Otherwise, D₁ does not intersect the right vertical side of the extent F.sub.β. In that case, equation (4.34b) is substituted in equation (4.33a) and the solution Y=Y₂ is obtained. If Y_(b)β ≦Y₂ ≦Y_(t)β, then D₁ intersects the left vertical side of extents F.sub.β. The region F in this case has for the coordinates of its TL corner (X_(l)β, Y₂). However, the coordinates of its BR corner are determined after D₁ is evaluated to determine whether or not it intersects with the bottom horizontal side of extent F.sub.β. If D₁ intersects only with right vertical side of F.sub.β, the coordinates of the BR corner of region F are (X_(r)α, Y_(b)α). If D₁ also intersects with the right vertical side of F.sub.β, the coordinates of the BR corner of region F are (X_(r)β, Y_(b)β). Furthermore, if D₁ also intersects with the bottom horizontal side of F.sub.β, then the coordinates of the BR corner of region F are (X₁, Y_(b)α). The procedure for determining the value of X₁ follows.

If Y_(b)β ≦Y₂ ≦Y_(t)β, then to determine X₁, equation (4.34c) is substituted in equation (4.33a). If X_(r)β ≦X₁ ≦X_(l)β, then D₁ intersects the bottom horizontal side of the extent F.sub.β. The coordinates of the TL and BR corners of region F for this case are (X_(l)α, Y_(t)α) and (X₁, Y_(b)β), respectively. For the case of D₁ intersecting the bottom horizontal side, as well as the top horizontal side of extent F.sub.β, the coordinates of the BR corner of region F are given by (X₁, Y_(b)β). If X_(l)α ≦X_(l)β, the coordinates of the TR corner of region F are given by (X₂, Y_(t)α), otherwise they are given by (X_(l)β, Y_(t)β). The procedure for determining the value of X₂ follows.

If X_(r)β ≦X₁ ≦X_(l)β then to determine X₂ equation (4.34d) is substituted in equation (4.33a). If X_(r)β ≦X₂ ≦X_(l)β, then D₁ intersects the bottom horizontal side of the extent F.sub.β. The coordinates of the TL and BR corners of region F are then given by (X_(l)β, Y_(l)β) and (X_(r)α, Y_(b)α), respectively. For the case of D₁ intersecting the top horizontal side and the right vertical side of F.sub.β, the coordinates of the BR corner of region F are given by (X_(r)β, Y₁). If X_(l)α ≦X_(l)β, then the coordinates of the TR corner of region F are given by (X₂, Y_(t)α), otherwise they are given by (X_(l)β, Y_(t)β).

If D₁ does not intersect any of the four sides of F.sub.β, then the above procedure is repeated to determine if diagonal D₂ of extent F.sub.β intersects with extent F.sub.α.

The pseudo code for determining the intersections of N profiles ₁ ^(n) S.sub.σ (P), . . . , _(N) ^(n) S.sub.σ (P) on a common surface is presented. These N profiles are enclosed by their respective extents, F₁, . . . F_(N). The first part of the algorithm takes an extent from the total number of original N extents and determines whether or not it overlaps another extent. Each F.sub.α, α=1,N is checked to determine whether or not it overlaps another extent, F.sub.β, β=α+1,N. The two logicals O.sub.α and I.sub.α indicate the status of the extent F.sub.α ; the former indicates whether or not it overlaps another extent and the latter indicates whether or not the profiles within the overlapped extents intersect.

If two extents are not overlapping, that is, they have an Ω₁ relationship, then the algorithm takes another extent and determines whether or not it overlaps with F.sub.α. If none of the extents overlaps an extent F.sub.α, then it remains an independent FMEM and the logicals I.sub.α and O.sub.α are set to false. However, if an overlapped extent F.sub.β is found, then the logical O.sub.α is set to true and the overlapped region F.sub.αβ is determined. The curves of the two profiles .sub.α^(n) S.sub.σ (P) and .sub.β^(n) S.sub.σ (P) are then evaluated to determine whether or not they intersect within F.sub.αβ. If none of the curves intersects, that is, they have Ω₂ relationship, then the resultant profile is given by .sub.Ω.sbsb.2^(n) S_(F) (P) [recall equation (4.23)]. If they do intersect, that is, they have an Ω₃ relationship, then the algorithm sets the logical I.sub.α to true and continues to determine the intersection properties of the two profiles within F.sub.αβ.

Assume that it has been determined that n₁ curves of profile .sub.α^(n) S.sub.σ (P) and n₂ curves of profile .sub.β^(n) S.sub.σ (P) are found to lie within region F.sub.αβ. Then only those curves are considered. The end points, U_(i) and U_(i+1), of the curves .sub.α^(n) γ_(i) (U_(i), U_(i+1) ; P) and .sub.β^(n) γ_(i) (U_(i), U_(i+1) ; P) are evaluated to determine whether or not they are inside the intersecting cavities .sub.β^(n) S.sub.σ (P) and .sub.α^(n) S.sub.σ (P), respectively. If both points U_(i) and U_(i+1) of a curve are inside one of the intersecting cavities, then that curve is removed. If both curves partially lie outside their intersecting cavities, the algorithm determines the combination type C_(k), k=1, . . . , 6, for the pair of intersecting curves .sub.α^(n) γ_(i) (U_(i), U_(i+1) ; P) and .sub.β^(n) γ_(i) (U_(i), U_(i+1) ; P). For the combinations C₄, C₅ or C₆, the algorithm uses Sylvester's method to determine whether or not the curves intersect. If they intersect, the roots are found by a standard root finding method. For the combinations C₁, C₂ or C₃, the roots are found by solving the equations (4.3), (4.7) and (4.12), respectively. The roots are the intersection points R_(l), l=1, . . . , x, which are stored for later processing.

The second part of the algorithm retrieves and then groups the extents that have been found to overlap each other. An extent F_(m) is then formed to surround the N.sub.ε,m overlapping extents, where m=N+1, . . . . The process then proceeds to search for the number of profiles, denoted N_(f),m, that intersect within F_(m). A separate counter records the number of F_(m) that has been found. The maximum value of this counter is M.

The third section of the algorithm takes each of the F.sub.α, α=1, . . . , N.sub.ε,m that reside within F_(m) and determines whether or not the profile within F.sub.α has intersected other profiles. If the logical I.sub.α is false, then the algorithm takes the next extent; otherwise it uses vertex inside algorithm to determine whether or not each of the intersection points R_(l) lies inside an intersecting cavity .sub.β^(n) S_(C) (P). The intersection points that are found to reside inside a cavity are removed. The remaining intersection points are ordered on each curve and the segments that are removed and the ones that remain for each curve are determined. If a point U_(i) of a curve γ_(i) is inside an intersecting cavity, the odd segments are removed and the even segments remain; otherwise the even segments are removed and the odd segments remain. This is done using either equation (4.6), (4.11) or (4.13) as the case may be. The segments of each curve that remain are collected to define the profiles .sub.α^(n) S_(I) (P) and .sub.α^(n) S_(C) (P). Once all extents F.sub.α are processed within each F_(m), the resulting profiles .sub.Ω.sbsb.3^(n) S_(F) (P) are determined using equation (4.31). The resultant profile _(m) ^(n) S_(F) (P) for each F_(m) is then determined using equation (4.32). The process is repeated for each F_(m) that has been formed to enclose overlapping extents.

In the foregoing discussion, a composite FMEM was introduced which resulted from intersections of multiple profiles on a given surface. This FMEM is capable of representing a large family of 21/2-D machinable shapes. During the design process the engineer may want to machine on more than one face. This requires that a means be developed whereby the orthogonal intersection of two FMEMs be evaluated. Identifying and determining these intersections require that a means first be developed to determine if an intersection of the orthogonal FMEMs has taken place, and if it has, to obtain all their spatial intersection curves.

Notation for a general profile was described above and was used to describe the intersections of multiple profiles on a given face n. This notation is now extended to include the orthogonal intersections of the associated very general profile shells in the following way. A shell is denoted by _(v) ^(n) S_(s)σ (ψ_(p)). The left superscript n indicates the face number of the part to which the profile shell is orthogonal, the left subscript v is reserved for the profile number, and the right subscript σ identifies the type of shell surface, that is, either a cavity (σ=C) or an island (σ=I). A right subscript s indicates that the shell surface is topologically in a 3D space. A profile shell _(v) ^(n) S_(s)σ (ψ_(p)) can intersect orthogonally aith a profile shell .sub.μ^(m) S_(s)σ (ψ_(p)), when n≠m and face m is not parallel to face n. For example, if a profile shell exists on surface 1 then the orthogonal faces are 2,3,5 and 4 but not 6 because face 6 is parallel to face 1. The point ψ_(p) is an arbitrary point on the profile surface.

A shell comprises of surfaces, curves and points in 3D space. The notation mentioned above is used for each individual profile surface. For example, a general surface is given by _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The right subscript i indicates the type of surface, that is, either a plane (i=1), a quadric surface (i=5) or a cylindrical surface (i=2,3,4). The first four points U_(i), U_(i+1), U_(i) and U_(i+1) that are enclosed in parentheses represent the end points of the surface, the first pair on the face n and the second pair on a plane parallel to n. Projections of points or curves on a surface that are located at a distanced, the profile depth, from face n and parallel to it, are specified by a "hat" () on the associated points or curves. For example, the points U_(i) and U_(i+1) are the projections of the points U_(i) and U_(i+1), respectively, on a surface parallel to face n. The projection of a curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) is given by _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P), where the former exists on face n and the latter exists on a plane parallel to the face n and a distance d from it.

An arbitrary point on a shell surface is given by _(v) ^(n) ψ_(p) (x_(p), y_(p) ; z_(p)), where (x_(p), y_(p), z_(p)) are the coordinates in the (x,y,z) coordinate system. Each of these three coordinates of a point is denoted the same way. For example, the x-coordinate of a point _(v) ^(n) ψ_(p) is given by _(v) ^(n) x_(p). However, a point, when included within parentheses in order to define curves and surfaces, is used without the left subscript and superscript. For example, the end points U_(i), U_(i+1), U_(i) and U_(i+1) are used without left subscripts and superscripts to specify a surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The points P_(j),i, j=1, . . . , 4 and i=1, . . . , 8, introduced in the last chapter, use the same notation. Similarly, the coordinates of a point when included within parentheses, in order to define the point, are used without left subscripts and superscripts. For example, the coordinates x_(p), y_(p) and z_(p) are used within parentheses to specify the point _(v) ^(n) ψ_(p) (x_(p), y_(p) ; z_(p)) have no left subscripts and superscripts. The coefficients A_(j), B_(j), C_(j), D_(j), G_(j), H_(j) and K_(j) are specified in a similar manner. For example, the coefficient _(v) ^(m) G_(j) exists on face m and is used to define a curve that is part of a profile shell _(v) ^(m) S_(s)σ (ψ_(p)).

An additional right subscript s is added to indicate that the segment of a curve is a subset of that curve. The same notation is used for a patch of a surface. For example, _(v) ^(n) χ_(si) (U_(i), U_(i+1), R₀, R_(K-1) ; ψ_(p)) denotes a patch of a profile surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)).

In some instances, curves and surfaces are specified without the points within the parentheses when an explicit notation is not required. For example, a surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) may be specified by _(v) ^(n) γ_(si) or a curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) is given by _(v) ^(n) γ_(i). Similarly, a point is given without its coordinates. For example, the end points U_(i) and U_(i+1) are frequently used without the left subscripts and superscripts as well as without specifying their repective coordinates (x_(i), y_(i), z_(i)) and (x_(i+1), y_(i+1), z_(i+1)).

In order to obtain the orthogonal intersections of two FMEMs, a profile shell consisting of quadric ruled surfaces of a 2-D profile on face n is introduced. A quadric ruled surface is represented by a straight line generator ψ and the curves at the two ends of the generator, called directrics of the surface. A general profile shell _(v) ^(n) S_(s)σ (ψ_(p)), shown in FIG. 44, is a closed envelop such that its projection on face n is the profile _(v) ^(n) S.sub.σ (P), and its projection on a plane parallel to the surface n and at a distance d, the profile depth, is the profile _(v) ^(n) S.sub.σ (P). The two profiles _(v) ^(n) S.sub.σ (P) and _(v) ^(n) S.sub.σ (P) are exactly the same, except that they are a distance d from each other. Each of them is given by equation (3.18), where _(v) ^(n) S.sub.σ (P) consists of four edges e_(j), four quadric curves q_(j) and four groups of circular arcs g_(j),k, k=1,2,3. The arbitrary point P lies on the profile _(v) ^(n) S.sub.σ (P) and the corresponding arbirary point P=(x,y,z+d) lies on the profile _(v) ^(n) S.sub.σ (P). The point ψ_(p) is an arbitrary point on the generator line ψ such that at the two ends of the generator line ψ it coincides with the points P and P.

A general profile shell surface _(v) ^(n) S_(s)σ (ψ_(p)) consists of four sets of three types of quadric surfaces: a plane _(v) ^(n) e_(sj) (P_(j),1, P_(j),6, P_(j),1, P_(j),6, ψ_(p)), a quadric surface _(v) ^(n) q_(sj) (e_(j), e_(j+1), e_(j), e_(j+1) ; ψ_(p)) and a group of three cylindrical surfaces _(v) ^(n) g_(sj),k (P_(j),k+1, P_(j),k+2, P_(j),k+1, P_(j),k+2 ; ψ_(p)), k=1,2,3. The directric for a surface of the shell _(v) ^(n) S_(s)σ (ψ_(p)) is the corresponding curve of the profile _(v) ^(n) S.sub.σ (P). Geometrically, an implicit quadric surface is given by a space occupied by points ψ_(p) in the (x,y,z) coordinate system. In parametric space it is given by the points (s,t), where the parameter s varies from 0 to 1 on the directric curve and the parameter t varies from 0 to 1 on the generator line. The directric curve for the plane _(v) ^(n) e_(sj) (P_(j),1, P_(j),6, P_(j),1, P_(j),6 ; ψ_(p)) is the edge _(v) ^(n) e_(j) (P_(j),1, P_(j),6 ; P); for the quadric surface _(v) ^(n) q_(sj) (e_(j), e_(j+1), e_(j), e_(j+1) ; ψ_(p)) it is the quadric curve _(v) ^(n) q_(j) (e_(j), e_(j+1) ; P); and for each of the three cylindrical surfaces _(v) ^(n) g_(sj),k (P_(j),k+1, P_(j),k+2, P_(j),k+1, P_(j),k+2 ; ψ_(p)) it is the corresponding circular arc _(v) ^(n) g_(j),k (P_(j),k+1, P_(j),k+2 ; P), k=1,2,3.

The concept of minimum rectangular prismatic volume containing an FMEM was introduced above. This rectangular prismatic volume is now called a cavity container. A cavity container is the minimum prismatic volume that encloses the profile. The containers will be used to determine whether or not two orthogonal FMEMs intersect. If two containers intersect, the cavities and islands within them may or may not intersect. If the containers do not intersect, then the cavities and islands do not intersect.

Consider two orthogonal containers F_(s).sbsb.1 and F_(s).sbsb.2 shown in FIGS. 45 through 47. These two containers can be related to each other in one of three ways: (1) they do not intersect, denoted Ω_(s).sbsb.1 ; (2) they intersect, but the profile surfaces do not intersect, denoted Ω_(s).sbsb.2 ; and (3) they intersect and the profile surfaces intersect, denoted Ω_(s).sbsb.3. FIG. 45 shows the case where the containers do not intersect. For this case the containers F_(s).sbsb.1 and F_(s).sbsb.2 contain two independent FMEMs, (FMEM)₁ and (FMEM)₂, respectively. The procedure used to define a profile of an FMEM above. FIG. 46 shows the case of two intersecting containers F_(s).sbsb.1 and F_(s).sbsb.2 in which the profile surfaces do not intersect In this case a third container F_(s).sbsb.3 surrounds the two intersecting containers, and the container F_(s).sbsb.3 is a new container enclosing the two non-intersecting profile shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)) on the m and n surfaces, respectively. The profiles ₁ ^(m) S.sub.σ (P) and ₂ ^(n) S.sub.σ (P) are the directric curves of the two shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)), respectively. The surfaces of the shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)), when contained in the same container, but do not intersect, are designated as combination Π₀.

FIG. 47 shows the case when the two containers F_(s).sbsb.1 and F_(s).sbsb.2 intersect, and one or more of the surfaces of the two profile shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)) intersect. These intersections result in six combinations of intersecting surfaces, which are denoted Π₁, . . . , Π₆, and are discussed in detail below.

The test to determine whether or not two FMEM profile shells intersect consists of two parts. The first part uses the containers of the individual FMEMs. Referring to FIG. 48, the two containers F_(s).sbsb.1 and F_(s).sbsb.2 are represented in their respective local FMEM coordinate systems (x₁,y₁,z₁) and (x₂,y₂,z₂) on the surfaces m and n, respectively, and each of which is oriented parallel to the global coordinate system (X,Y,Z). However, the orientation of their respective surface shells are with respect to their respective individual coordinate system (x,y,z). The intersecting volume F_(s).sbsb.12, which is the space common to both containers F_(s).sbsb.1 and F_(s).sbsb.2, is first identified. When two containers intersect they are surrounded by a third container F_(s).sbsb.3, which is the smallest rectangular prismatic volume that encloses both F_(s1) and F_(s2) and is expressed in the composite FMEM coordinate system (x,y,z). The profile surfaces enclosed by the containers F_(s).sbsb.1 and F_(s).sbsb.2 can only intersect in the common volume F_(s).sbsb.12. The coordinates of the bottom right hand corner of the space F_(s).sbsb.12 in the (x,y,z) coordinate system are (x_(min),y_(min),z_(min)) and the coordinates of the top left hand corner are (x_(max),y_(max),z_(max)).

The second part of the test is applied only to the surfaces e_(s).sbsb.j, q_(s).sbsb.j and g_(s).sbsb.j,k of the two profile shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)) that are present within the space F_(s).sbsb.12. The location of each surface of the two shells is used to determine whether or not it is within the space F_(s).sbsb.12. If it is within F_(s).sbsb.12, then it is marked for further processing. Referring to FIG. 49 it is seen that there are only six unique combinations of intersections among the surfaces e_(s).sbsb.j, q_(s).sbsb.j and g_(s).sbsb.j,k of the two shells ₁ ^(m) S_(s)σ (ψ_(p)) and ₂ ^(n) S_(s)σ (ψ_(p)). The combinations are denoted Π_(k), k=1, . . . , 6. The combinations Π₁, Π₂ and Π₃ represent interactions of a plane e_(s).sbsb.j with another plane e_(s).sbsb.j, with a quadric surface q_(s).sbsb.j and with any one of the cylindrical surface g_(s).sbsb.j,k, respectively. The intersection curve resulting from a planar intersection lies in each of the intersecting planes. The combinations Π₄, Π₅ and Π₆ represent the intersections of two second order surfaces, and result in a higher order space curve. When the surfaces do not intersect in the space F_(s).sbsb.12 is denoted Π₀. Each intersection involving two second order orthogonal surfaces is tested using the Sylvester's resultant method, in which the Sylvester's determinant |R_(S) | is expressed in terms of two of the three coordinate variables.

The six possible intersections Π_(k), k=1, . . . , 6 can be determined by using a general implicit surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)), i=1,2,3,4,5;n=1, . . . , 6 and v=1,2 . . . of a profile shell _(v) ^(n) S_(s)σ (ψ_(p)), σ=C or I, on a face n. This surface is a ruled quadric surface, and is represented by its generator _(v) ^(n) ψ_(i) (P, P; ψ_(p)) and the directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) of the surface. The point P lies on the directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P), the point P lies on the directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) and the point ψ_(p) is any point on the generator line. A ruled surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is obtained by moving the generator along its directric _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) from point U_(i) to the point U_(i+1). Mathematically, the implicit expression of a quadric ruled surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is same as the implicit representation of its directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P), which is given by equation (4.1). However, in the parametric space a point ψ_(p) (x,y,z) on the surface _(v) ^(n) γ_(si) is represented by two parameters s and t as follows:

    ψ.sub.p (x,y,z)=(1-t)P(x,y,z)+tP(x,y,z+d)              (5.1)

Equation (5.1) represents three equations, one for each of the three coordinates x, y and z. Each of these coordinates of either point P or P is function of the parameter s. Each of these expressions for each coordinate of P or P depends on the directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P). For i=1 it is linear in s; for i≠1 it is quadratic. The expressions for P and P, which are substituted into equation (5.1), are given for a plane (i=1), a quadric surface (i=5) and for a cylindrical surface (i=2,3 or 4) above. The parameter ψ, varies from 0 to 1 along the generator line ψ, whereas the parameter s varies from 0 to 1 along the directric curve _(v) ^(n) γ_(i) (U_(i), U_(i+1) ; P) of the surface _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). From equation (5.1), it is seen that ψ_(p) =P at t=0, whereas ψ_(p) =P at t=1.

For i=1, the surface _(v) ^(n) γ_(s1) represents the plane _(v) ^(n) e_(sj) ; for i=2,3,4 _(v) ^(n) γ_(si) represents one of the cylindrical surfaces _(v) ^(n) g_(sj),k, k=1,2,3; and for i=5 _(v) ^(n) γ_(s5) represents a quadric surface _(v) ^(n) q_(sj). Furthermore, U_(i) =P_(j),i, U_(i) =P_(j),i and U_(i+1) =P_(j),i+1, U_(i+1) =P_(j),i+1 except for i=5, where U_(i) =P_(j),i+1, U_(i) =P_(j),i+1 and U_(i+1) =P_(j+1),i-4, U_(i+1) =P_(j+1),i-4. The coordinates of the points U_(i) and U_(i+1) in the (x,y,z) coordinate system are given by (x_(i),y_(i),z_(i)) and (x_(i+1), y_(i+1), z_(i+1)), respectively. The coordinates of U_(i) and U_(i+1) are given by (x_(i),y_(i),z_(i) +d) and (x_(i+1),y_(i+1),z_(i+1) +d), respectively.

Consider an intersection of a cavity ₁ ^(m) S_(sC) (ψ_(p)) either with another cavity ₂ ^(n) S_(sC) (ψ_(p)) or with an island ₂ ^(n) S_(sI) (ψ_(p)). Each of the six combinations Π_(k), k=1, . . . , 6 for the intersections of a cavity with another cavity and a cavity with an island are discussed in the following sections. It is shown how the intersection curves η_(l), l=1, . . . , x, where x is the total number of intersection curves, are obtained. Each curve consists of a series of intersection points R_(l), l=0, . . . , K-1, where K is the total number of points found for each intersection curve. The intersection points R_(l) are the roots of the polynomials of the two intersecting surfaces ₁ ^(m) γ_(si) and ₂ ^(n) γ_(si). Hence, the problem is reduced to finding the roots of the two polynomials of the intersecting surfaces ₁ ^(m) γ_(si) and ₂ ^(n) γ_(si) for each of the six combinations.

The method used to determine R_(l) is based on taking a parametric generator line ₁ ^(m) ψ_(i) (P, P; t) of a parametric surface ₁ ^(m) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and finding its intersection with an orthogonal implicit surface ₂ ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The parametric generator line is first taken at s=0, that is, at ₁ ^(m) ψ_(i) (U_(i), U_(i) ; t) which is on the surface ₁ ^(m) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)).

Intersections of the generator line with the other surface ₂ ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is then found. The generator line ₁ ^(m) ψ_(i) (P, P; t) is moved by a small increment of s and the next intersection is found. This process is repeated until either the generator line ₁ ^(m) ψ_(i) (P, P; t) reaches the final position or s=1; that is, the generator ₁ ^(m) ψ_(i) (U_(i), U_(i) ; t). In this manner K intersection points R_(l), l=0, . . . , K-1 are found on the resulting intersection curve η_(l). The intersection curve η_(l) is then considered as a collection of curved segments. Each segment of the intersection curve η_(l) is evaluated to determine whether or not it is within the bounds of the implicit surface ₂ ^(n) γ_(si). If it is not, then it is rejected. If it is, then it is included as part of the intersection curve η_(l). This process is repeated for all surfaces of the profile shell ₂ ^(n) S_(s)σ (ψ_(p)).

For the case of a cavity shell ₁ ^(m) S_(sC) (ψ_(p)) intersecting an island shell ₂ ^(n) S_(sI) (ψ_(p)), only the surfaces ₂ ^(n) γ_(si) of the island are affected. The cavity ₁ ^(m) S_(sC) (ψ_(p)) removes the material from the island ₂ ^(n) S_(sI) (ψ_(p)). An island ₂ ^(n) S_(sI) (ψ_(p)) does not remove material from the cavity ₁ ^(m) S_(sC) (ψ_(p)). Thus, for such an intersection, the surfaces ₁ ^(m) γ_(si) of the cavity shell ₁ ^(m) S_(sC) (ψ_(p)) are not considered and only the surfaces ₂ ^(n) γ_(si) of the island shell ₂ ^(n) S_(sI) (ψ_(p)) in the region F_(s).sbsb.12 are considered.

The following sections explain in detail the six intersection combinations Π_(k), k=1, . . . , 6, for a cavity ₁ ^(m) S_(sC) (ψ_(p)) intersecting either another cavity ₂ ^(n) S_(sC) (ψ_(p)) or an island ₂ ^(n) S_(s1) (ψ_(p)).

The combination Π₁ denotes the intersection of the two planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)), which are each described by equation (3.5). Expanding equation (3.5) for faces m and n, respectively, in the local coordinate system for (FMEM)₃ yields

    .sub.1.sup.m γ.sub.s1 (U.sub.i, U.sub.i+1, U.sub.i, U.sub.i+1 ; ψ.sub.p)=2 .sub.1.sup.m G.sub.j x+2 .sub.1.sup.m H.sub.j y+2 .sub.1.sup.m J.sub.j z+.sub.1.sup.m K.sub.j =0            (5.2a)

    .sub.2.sup.n γ.sub.s1 (U.sub.i, U.sub.i+1, U.sub.i, U.sub.i+1 ; ψ.sub.p)=2 .sub.2.sup.n G.sub.j x+2 .sub.2.sup.n H.sub.j y+2 .sub.2.sup.n J.sub.j z+.sub.2.sup.n K.sub.j =0            (5.2b)

where, the coefficients ₁ ^(m) G_(j), ₁ ^(m) H_(j), ₁ ^(m) J_(j) and ₁ ^(m) K_(j) for (FMEM)₁ and the coefficients ₂ ^(n) G_(j), ₂ ^(n) H_(j), ₂ ^(n) J_(j) and ₂ ^(n) K_(j) for (FMEM)₂ are given by equation (3.7). To solve the above two equations, the plane ₁ ^(m) γ_(s1) is represented in parametric space (s,t) such that the surface ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is given by a generator line ₁ ^(m) ψ_(i) (P, P; t) and the directric edge ₁ ^(m) γ₁ (U_(i), U_(i+1) ; s) as shown in FIG. 50. The intersections of the generator line ₁ ^(m) ψ_(i) (P, P; t) with the plane ₂ ^(n) γ_(s1) (U, U_(i+1), U_(i), U_(i+1) ; ψ_(p)) are considered for 0≦s≦1. An arbitrary point ₁ ^(m) ψ_(p) =(₁ ^(m) x_(p), ₁ ^(m) y_(p), ₁ ^(m) z_(p)) on the generator line is related to the points P and P by equation (5.1). The point P is an arbitrary point that exists on the directric curve ₁ ^(m) γ₁ (U_(i), U_(i+1) ; s) and the point P is another arbitrary point that exists on the other end of the generator ₁ ^(m) ψ_(i) (P, P; t) on the other directric curve ₁ ^(m) γ_(i) (U_(i), U_(i+1) ; s). The points P and P on an edge directric ₁ ^(m) γ₁ are given by

    P=(1-s)U.sub.i +s U.sub.i+1                                (5.3)

    P=(1-s)U.sub.i +s U.sub.i+1                                (5.4)

For the case of P=U_(i) and P=U_(i), the generator line is at its initial position of s=0; and for the case of P=U_(i+1) and P=U_(i+1), the generator line is at its final position of s=1. Also, when t=0, ψ_(p) =P, and when t=1, ψ_(p) =P.

The general plane ₁ ^(m) γ_(s1), m=1, . . . , 6 represents a plane whose directric edge ₁ ^(m) γ₁ exists on one of the six faces of (FMEM)₁. Substituting equations (5.3) and (5.4) in equation (5.1), and then simplifying for each of the six cases in the (x,y,z) coordinate system of (FMEM)₃, yields ##EQU25## where, (x₀,y₀,z₀) are the coordinates of the origin of the local (x,y,z) system of (FMEM)₃ in the global coordinate system (X,Y,Z), and U=U₃ +x₀, V=V₃ +y₀ and W=W₃ +z₀. The dimensions U₃, V₃, and W₃ represent the size of (FMEM)₃ in the X, Y and Z directions, respectively. The coordinates (₁ ^(m) x_(i), ₁ ^(m) y_(i), ₁ ^(m) z_(i)) and (₁ ^(m) x_(i+1), ₁ ^(m) y_(i+1), ₁ ^(m) z_(i+1)) represent the end points ₁ ^(m) U_(i) and ₁ ^(m) U_(i+1) of (FMEM)₁, respectively, in the (x,y,z) coordinate system, and d₁ is the depth of the profile shell of (FMEM)₁.

There are 24 combinations that fall into the classification Π₁. The plane ₂ ^(n) γ_(s1) may exist on one of the four faces orthogonal to face m. More explicitly these 24 cases are: for m=1, n=2,3,4,5; for m=2, n=1,3,5,6; for m=3, n=1,2,4,6; for m=4, n=1,3,5,6; for m=5, n=1,2,4,6; and for m=6, n=2,3,4,5. For each of these cases, the appropriate equation from the set of equations (5.5a) through (5.5f) is substituted into equation (5.2b) to yield a value of t. Specifically:

For the case of m=1 and n=2 or n=4,

    t=-{2 .sub.2.sup.n G.sub.j [(1-s) .sub.1.sup.1 x.sub.i +s .sub.1.sup.1 x.sub.i+1 ]+2 .sub.2.sup.n J.sub.j z.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n J.sub.j d.sub.1                              (5.6a)

For the case of m=1 and n=3 or n=5,

    t=-{2 .sub.2.sup.n H.sub.j [(1-s) .sub.1.sup.1 y.sub.i +s .sub.1.sup.1 y.sub.i+1 ]+2 .sub.2.sup.n J.sub.j z.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n J.sub.j d.sub.1                              (5.6b)

For the case of m=2 and n=1 or n=6,

    t={2 .sub.2.sup.n G.sub.j [(1-s) .sub.1.sup.2 x.sub.i +s .sub.1.sup.2 x.sub.i+1 ]+2 .sub.2.sup.n H.sub.j V+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n H.sub.j d.sub.1                                           (5.6c)

For the case of m=2 and n=3 or n=5,

    t={2 .sub.2.sup.n J.sub.j [(1-s) .sub.1.sup.2 z.sub.i +s .sub.1.sup.2 z.sub.i+1 ]+2 .sub.2.sup.n H.sub.j V+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n H.sub.j d.sub.1                                           (5.6d)

For the case of m=3 and n=1 or n=6,

    t={2 .sub.2.sup.n H.sub.j [(1-s) .sub.1.sup.3 y.sub.i +s .sub.1.sup.3 y.sub.i+1 ]+2 .sub.2.sup.n G.sub.j U+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n G.sub.j d.sub.1                                           (5.6e)

For the case of m=3 and n=2 or n=4,

    t={2 .sub.2.sup.n J.sub.j [(1-s) .sub.1.sup.3 z.sub.i +s .sub.1.sup.3 z.sub.i+1 ]+2 .sub.2.sup.n G.sub.j U+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n G.sub.j d.sub.1                                           (5.6f)

For the case of m=4 and n=1 or n=6,

    t=-{2 .sub.2.sup.n G.sub.j [(1-s) .sub.1.sup.4 x.sub.i +s .sub.1.sup.4 x.sub.i+1 ]+2 .sub.2.sup.n H.sub.j y.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n H.sub.j d.sub.1                              (5.6g)

For the case of m=4 and n=3 or n=5,

    t=-{2 .sub.2.sup.n J.sub.j [(1-s) .sub.1.sup.4 z.sub.i +s .sub.1.sup.4 z.sub.i+1 ]+2 .sub.2.sup.n H.sub.j y.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n H.sub.j d.sub.1                              (5.6h)

For the case of m=5 and n=1 or n=6,

    t=-{2 .sub.2.sup.n H.sub.j [(1-s) .sub.1.sup.5 y.sub.t +s .sub.1.sup.5 y.sub.i+1 ]+2 .sub.2.sup.n G.sub.j x.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n G.sub.j d.sub.1                              (5.6i)

For the case of m=5 and n=2 or n=4,

    t=-{2 .sub.2.sup.n J.sub.j [(1-s) .sub.1.sup.5 z.sub.i +s .sub.1.sup.5 z.sub.i+1 ]+2 .sub.2.sup.n G.sub.j x.sub.0 +.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n G.sub.j d.sub.1                              (5.6j)

For the case of m=6 and n=2 or n=4,

    t=-{2 .sub.2.sup.n G.sub.j [(1-s) .sub.1.sup.6 x.sub.i +s .sub.1.sup.6 x.sub.i+1 ]+2 .sub.2.sup.n J.sub.j W+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n J.sub.j d.sub.1                                           (5.6k)

For the case of m=6 and n=3 or n=5,

    t={2 .sub.2.sup.n H.sub.j [(1-s) .sub.1.sup.6 y.sub.i +s .sub.1.sup.6 y.sub.i+1 ]+2 .sub.2.sup.n J.sub.j W+.sub.2.sup.n K.sub.j }/2 .sub.2.sup.n J.sub.j d.sub.1                                           (5.6l)

It can be seen from the above equations that when the two planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) do not intersect, then for m=1 and m=6, ₂ ^(n) J_(j) =0; for m=2 and m=4, ₂ ^(n) H_(j) =0; and for m=3 and m=5, ₂ ^(n) G_(j) =0. When these coefficients are non-zero for their respective cases, equations (5.6a) through (5.61) yield the indicated value of t. Each intersection combination Π₁ yields only one value of t for a specific value of s, which corresponds to an implicit point ψ_(p) on the generator lines ₁ ^(m) ψ_(i) (P, P; t) and ₂ ^(n) ψ_(i) (P, P; t). Each value of s corresponds to a point P on the directric line ₁ ^(m) γ₁ (U_(i), U_(i+1) ; P) as well as a point P on the directric curve ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). The points P and P are obtained by substituting the value of s into equations (5.2) and (5.3), respectively. The process begins by positioning an imaginary generator line ₁ ^(m) ψ₁ (U_(i), U_(i) ; t) at s=0 and solving the appropriate equation in equations (5.6a) through (5.61) for t to obtain t₀. If this value t₀ is between 0 and 1, it is accepted one of the roots, otherwise it is rejected. This provides the first intersection point in parametric space (0,t₀). The imaginary generator line is then moved to the next value of s, say s₁, which in turn represents new values for the points P and P on the directric edge ₁ ^(m) γ₁ (U_(i), U_(i+1) ; P). The appropriate equation from the set of equations (5.6a) through (5.6l) is then solved for next value of t, that is, t₁. This provides the second intersection point in parametric space (s₁,t₁), provided that t₁ also lies between 0 and 1. This is repeated until all intersection points in parametric space (s,t) on the intersection line η_(l) are determined by varying s from s=0 to s=1. The final point is (1,t_(K-1)) when s=1, and the calculated value t_(K-1) is between 0 and 1. Each point (s,t) in parametric space represents a point on the intersection line η_(l). These K parametric points (0,t₀), (s₁,t₁), . . . , (1,t_(K-1)) are then transformed to the implicit points R_(l), l=0, . . . , K-1, given in the (x,y,z) system. The t and s values for each parametric intersection point are substituted into the appropriate set of equations (5.5a) through (5.5f), and yield the coordinates of the intersection point in the (x,y,z) coordinate system.

The next step is to determine whether or not the points R_(l), l=0, . . . , K-1 are within the boundaries of the other plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). This is achieved by taking each intersection point R_(l) and determining the parameter s and t on the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The parameter t for a point R (x,y,z) is obtained from the following equations: ##EQU26##

It can be seen from equations (5.7) that t=0 is the start point ₂ ^(n) U_(i) of the directric edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) and that t=1 is the start point ₂ ^(n) U_(i) of the other directric edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). In fact, t=0 is point P of the directric edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) and t=1 is point P of the directric edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). When the point lies between the two directrics ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P), then 0<t<1. The value t(R_(l)) for each intersection point R_(l), l=0, . . . , K-1 is obtained by substituting x=x_(e) when n=3 or 5, y=y_(e) when n=2 or 4, and z=z_(e) when n=1 or 6into equations (5.7), where (x_(e),y_(e),z_(e)) are the coordinates of the intersection point R_(l). The points R_(l) that are not within 0≦t≦1 are rejected. For the remaining R_(l), the parameter s is obtained from one of the following equations: ##EQU27##

It can be seen from equations (5.8) that s=0 is the starting point ₂ ^(n) U_(i) and that s=1 is the terminating point ₂ ^(n) U_(i+1) of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). When the point lies between points U_(i) and U_(i+1), then 0<s<1. However, a point that precedes U_(i) will have s<0 and a point that follows U_(i+1) will have s>1. The value s(R_(l)) for each intersection point R_(l), l=0, . . . , K-1 is obtained by substituting x=x_(e) when x_(i+1) ≠x_(i), or y=y_(e) when x_(i+1) and z_(i) =z_(i+1), or z=z_(e) when x_(i) =x_(i+1) and y=y_(i+1) into equation (5.8). The (x_(e),y_(e),z_(e)) are the coordinates of the intersection point R_(l). The points R_(l) that are not within 0≦s≦1 are rejected.

The plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)), however, may intersect with other surfaces ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) (i=2,3,4,5, and n≠m) of the shell ₂ ^(n) S_(sC) (ψ_(p)), and may have N₁ intersection curves η_(t), t=1, . . . , N₁. Similarly, the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) may intersect with other surfaces ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) (i=2,3,4,5, and n≠m) of the shell ₁ ^(m) S_(sC) (ψ_(p)), and may have N₂ intersection curves η_(l), l=1, . . . , N₂. This is illustrated in FIGS. 51 and 52. FIG. 51 shows the intersection of two planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) when a cavity shell ₁ ^(m) S_(sC) (ψ_(p)) intersects with cavity shell ₂ ^(n) S_(sC) (ψ_(p)). FIG. 52 shows the intersection of two planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) when a cavity shell ₁ ^(m) S_(sC) (ψ_(p)) intersects with an island shell ₂ ^(n) S_(s1) (ψ_(p)). The points on the intersection curve η₁ that results from the intersection of the two planes is obtained from equations (5.6a) through (5.6l). Another intersection curve η₂, shown in FIG. 51, results from the intersection of the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) with one of the surfaces ₁ ^(m) γ_(si), i=2,3,4,5, of the cavity shell ₁ ^(m) S_(sC) (ψ_(p)). The procedure for obtaining η₂ is explained subsequently.

FIG. 51 shows that the plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) has only one intersection curve η₁, whereas the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) has two intersection curves η₁ and η₂. Therefore, the plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) can be divided into two patches ₁ ^(m) χ_(si),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)) and ₁ ^(m) χ_(si),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)), where R₀,1 and R_(K-1),1 are the first and the last intersection points on the intersection curve η₁. The plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is subdivided into three patches; however, they cannot be identified until the relative positions of the intersection curves η₁ and η₂ with respect to each other and with respect to the two directric edges ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) are determined. In other words, the intersection points R_(l),1 of η₁ and R_(l),2 of η₂ need to be ordered along the generator line ₂ ^(n) ψ₁ (P, P; ψ_(p)). This ordering is done only if there is more than one intersection curve for the plane, and is achieved by comparing the values of the parameter t for each intersection point R_(l),1, t=0, . . . , K-1, and R_(l),2, t=0, . . . , K-1, of the two intersection curves η₁ and η₂, respectively. The value t(R_(l),1) is obtained from equation (5.7). Similarly, t(R_(l),2) is calculated by substituting the appropriate coordinates into equation (5.7). The intersection points are then ordered in ascending order for the parameter t. If t(R_(l),1)<t(R_(l),2) then the order is (P, R_(l),1, R_(l),2, P); otherwise the order is (P, R_(l),2, R_(l),1, P). The former order is shown in FIG. 51, and the latter in FIG. 53. Once the order is known, the patches for the plane ₂ ^(n) γ_(si) can be identified. For the order (P, R_(l),1, R_(l),2, P), the patches are ₂ ^(n) χ_(si),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)), ₂ ^(n) χ_(si),2 (R₀,1, R_(K-1),1, R₀,2, R_(K-1),2 ; ψ_(p)) and ₂ ^(n) χ_(si),3 (R₀,2, R_(K-1),2, U_(i), U_(i+1) ; ψ_(p)). For the reverse situation the order of the points is (P, Rl.sub.,2, Rl.sub.,1, P) and the three patches are ₂ ^(n) χ_(si),1 (U_(i), U_(i+1), R₀,2, R_(K-1),2 ; ψ_(p)), ₂ ^(n) χ_(si),2 (R₀,2, R_(K-1),2, R₀,1, R_(K-1),1 ; ψ_(p)) and ₂ ^(n) χ_(si),3 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)).

The patches are determined by dissecting the plane. However, there is no direct and well defined relation between the number of patches and the number of intersection curves on a plane. As shown in FIG. 54, when a plane _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) intersects an orthogonal surface .sub.μ^(m) γ_(si) (i=1,2,3,4,5, μ≠v and n⊥m), there are four intersection curves in this case, two combination Π₁ intersection lines η₁ and η₄, and two combination Π₃ intersection curves η₂ and η₃. The intersection points R_(l),1, l=0,1, . . . , 7, lie on η₁ ; points R_(l),2, l=0,1, . . . , 4, lie on η₂ ; and points R_(l),3, l=0,1, . . . , 4, lie on η₃. Line η₄ coincides with a generator line. The dissecting procedure assumes that the directric curve _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) is divided into small segments using the points U₁ ' through U₁₃ '. Similarly, the directric curve _(v) ^(n) γ₁ (U_(i), U_(i+1) ; P) is divided by the points U₁ ' through U₁₃ ' such that each of the points U₁ ', . . . , U₁₃ ' is a projection on the directric _(v) ^(n) γ₁ of the points U₁ ', . . . , U₁₃ ', respectively. There are 13 generator lines _(v) ^(n) ψ₁,1, . . . , _(v) ^(n) ψ₁,13, each of which starts from a corresponding point U' and ends at its projection U'. For example, line _(v) ^(n) ψ₁,1 connects the points U₁ ' and U₁ ', whereas the line _(v) ^(n) ψ₁,13 connects the points U₁₃ ' and U₁₃ '. Each of these 13 generator lines either intersects or does not intersect the intersection curves. If a generator line does not intersect an intersection curve, it is concluded that the line resides in a single patch. However, if it intersects N curves, it is considered as residing in N+1 patches. However, the generator line _(v) ^(n) ψ₁,11 includes the intersection curve η₄. In this case the plane is dissected by line η₄ into two patches. Besides this special case, any generator line that passes through the first intersection point R_(0j) and any line that passes through the last point R_(K-1),j of an intersection curve η_(j) dissects the plane into two patches in the direction of the parametric t axis. In addition to the dissection in the direction of the parametric t axis, each intersection curve η_(j) dissects the plane in the direction of the parametric s axis into two patches. As shown in FIG. 54, there are eight patches _(v) ^(n) χ_(s1),1, . . . , _(v) ^(n) χ_(s1),8 that result from the four intersection curves η₁, . . . , η₄.

Once the patches for a plane are determined, the patches that are removed and the patches that remain are identified. This is done by retaining the patch closest to the directric curve in the t direction, and then removing the next closest patch. This sequence of removing and retaining patches is repeated in the t direction until the last patch is reached. The patches _(v) ^(n) χ_(s1),1, _(v) ^(n) χ_(s1),4, _(v) ^(n) χ_(s1),6 and _(v) ^(n) χ_(s1),8 are retained as they are closest to the directric curve (have lower values of t). The patches _(v) ^(n) χ_(s1),2, _(v) ^(n) χ_(s1),5 and _(v) ^(n) χ_(s1),7, however, are removed as these are the next patches after the closest patches. The patch _(v) ^(n) χ_(s1),3 is also retained as it is the third closest patch to the directric curve. The plane _(v) ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is then specified as a collection of patches that is given by ##EQU28##

FIGS. 55 through 58 shows some of the ways in which two planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(si) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) may intersect. FIG. 55 shows the case when both planes share a full intersection line η₁. The plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s1),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)) and ₁ ^(m) χ_(s1),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)), whereas the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into the patches ₂ ^(n) χ_(s1),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)) and ₂ ^(n) χ_(s1),2 (R₀,1, R_(K-1),1, R₀,2, R_(K-1),2 ; ψ_(p)). The patches ₁ ^(m) χ_(s1),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) χ_(s1),2 (R₀,1, R_(K-1),1, R₀,2, R_(K-1),2 ; ψ_(p)) are removed since they lie inside a cavity. The dissected planes are therefore given by, respectively,

    .sub.1.sup.m γ.sub.s1 (U.sub.i, U.sub.i+1, U.sub.i, U.sub.i+1 ; ψ.sub.p)=.sub.1.sup.m χ.sub.s1,1 (U.sub.i, U.sub.i+1, R.sub.0,1, R.sub.K-1,1 ; ψ.sub.p)                                (5.10a)

    .sub.2.sup.n γ.sub.s1 (U.sub.i, U.sub.i+1, U.sub.i, U.sub.i+1 ; ψ.sub.p)=.sub.2.sup.n χ.sub.s1,1 (U.sub.i, U.sub.i+1, R.sub.0,1, R.sub.K-1,1 ; ψ.sub.p)                                (5.10b)

FIG. 56 shows the case when the planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) intersect partially and share the intersection line η₁. The plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into three patches ₁ ^(m) χ_(s1),1 (U_(i), U'_(K-1),1, R₅,1, R_(K-1),1 ; ψ_(p)), ₁ ^(m) χ_(si),2 (R₅,1, R_(K-1),1, U_(i), U'_(K-1),1 ; ψ_(p)) and ₁ ^(m) χ_(si),3 (U'_(K-1),1, U_(i+1), U'_(K-1),1, U_(i+1) ; ψ_(p)), and the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into three patches ₂ ^(n) χ_(s1),1 (U_(i+1), U'₅,1, R_(K-1),1, R₅,1 ; ψ_(p)), ₂ ^(n) χ_(s1),2 (R₅,1, R_(K-1),1, U'₅,1, U_(i+1),; ψ_(p)) and ₂ ^(n) χ_(s1),3 (U_(i), U'₅,1, U_(i), U'₅,1 ; ψ_(p)). It can be seen that the five intersection points R₀,1, . . . , R₄,1 are removed using the dissecting method discussed previously. The patches ₁ ^(m) χ_(s1),2 and ₂ ^(n) χ_(s1),2 are removed as they lie inside the cavity. The dissected planes ₁ ^(m) γ_(s1) and ₂ ^(n) γ_(s1) are therefore given by, respectively, ##EQU29##

FIG. 57 shows the case when the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) touches the orthogonal plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) such that its directric curve ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) lies entirely on the intersecting plane ₁ ^(m) γ_(s1) ; that is, the intersection line η₁ is either part of, or is equal to, the directric curve. In this case, only plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s1),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)) and ₁ ^(m) χ_(s1),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)), whereas the plane ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is not dissected. The patch ₁ ^(m) χ_(s1),2 is removed since it lies inside a cavity. The plane ₂ ^(n) γ_(s1) is intact and the plane ₁ ^(m) γ_(s1) is given by

    .sub.1.sup.m γ.sub.s1 (U.sub.i, U.sub.i+1, U.sub.i, U.sub.i+1 ; ψ.sub.p)=.sub.1.sup.m χ.sub.s1,1 (U.sub.i, U.sub.i+1, R.sub.0,1, R.sub.K-1,1 ; ψ.sub.p)                                (5.11c)

The last combination Π₁ is the case in which the intersection line η₁ coincides with one of the generator lines of either of the intersecting planes ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). As shown in FIG. 58, the generator line ₁ ^(m) ψ₁ (P, P; t) is coincident to the intersection line η₁ ; that is, every point ψ_(p) of line ₁ ^(m) ψ₁ corresponds to one of the intersection points Rl, l=0, . . . , K-1. However, these points Rl cannot be determined using equation (5.6). In this case, the generator line ₁ ^(m) ψ₁ (P, P; ψ_(p)) is parallel to the directric edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P). Therefore, the intersection line η₁ is simply the projection of the edge ₂ ^(n) γ₁ (U_(i), U_(i+1) ; P) on the plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) that is coincident with the generator line ₁ ^(m) ψ₁ (P, P; ψ_(p)).

A general expression for a plane _(v) ^(n) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) that is dissected into the patches χ_(s1),i (A'_(i-1), A'_(i), A'_(i-1), A'_(i) ; ψ_(p)), i=1,2, . . . , N_(se), is given by ##EQU30## where N_(se) is the number of patches that are retained. Also, A_(o) '=U_(i), A_(o) '=U_(i), A'_(N).sbsb.sq =U_(i+1), and A'_(N).sbsb.sq =U_(i+1).

The combination Π₂ denotes intersections between a plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and a second order quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The implicit expressions for the plane ₁ ^(m) γ_(s1) on face m is given by equation (5.2a), whereas the quadric surface ₂ ^(n) γ_(s5) on face n in the local (x,y,z) coordinate system of (FMEM)₃ is given by ##EQU31## where, the coefficients ₂ ^(n) A_(j), ₂ ^(n) B_(j), ₂ ^(n) C_(j), ₂ ^(n) D_(j), ₂ ^(n) E_(j), ₂ ^(n) F_(j), ₂ ^(n) G_(j), ₂ ^(n) H_(j), ₂ ^(n) J_(j) and ₂ ^(n) K_(j) are given by equation (3.13). Equation (5.13) describes a general implicit quadric surface in space with respect to the (x,y,z) coordinate system. This equation is considerably simplified when the quadric surface is oriented parallel to one of the three axes of the (x,y,z) coordinate system. FIGS. 59 through 61 show the three cases in which each of the quadric surfaces is oriented parallel to one of the three axes. The simplified equations for the three cases are given below. ##EQU32##

Substituting an appropriate set of equations from equations (5.5a) through (5.5f) into the correspondingly appropriate equation from equations (5.14a) through (5.14c) yields the following quadratic equation in t:

    δ.sub.1 t.sub.2 +δ.sub.2 t+δ.sub.3 =0    (5.15) ##EQU33## where (x.sub.0,y.sub.0,z.sub.0) are the coordinates of the origin of the local (x,y,z) system of (FMEM).sub.3 in the global coordinate system (X,Y,Z), and U=U.sub.3 +x.sub.0, V=V.sub.3 +y.sub.0 and W=W.sub.3 +z.sub.0. The dimensions U.sub.3, V.sub.3, and W.sub.3 represent the size of the (FMEM).sub.3 in the X, Y and Z directions, respectively. The coordinates (.sub.1.sup.m x.sub.i, .sub.1.sup.m y.sub.i, .sub.1.sup.m z.sub.i) and (.sub.1.sup.m x.sub.i+1, .sub.1.sup.m y.sub.i+1, .sub.1.sup.m z.sub.i+1) represent the end points .sub.1.sup.m U.sub.i and .sub.1.sup.m U.sub.i+1 of (FMEM).sub.1, respectively, in the (x,y,z) coordinate system, and d.sub.1 is the depth of the profile shell (FMEM).sub.1.

Solving for t in equation (5.15) gives the values t₁ and t₂ for a specific value of s. The plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and the quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) do not intersect at that value of parameter s if δ₂ ² -4δ₁ δ₃ <0. Furthermore, there is only one root t₁ for that value of the parameter s when δ₂ ² -4δ₁ δ₃ =0. When δ₂ ² -4δ₁ δ₃ >0 the intersection points are R₁ =(x_(q1),y_(q1),z_(q1)) and R₂ =(x_(q1),y_(q2),z_(q2)). The implicit intersection points R₁ and R₂ are obtained by substituting t₁ and t₂ into the appropriate equation from equations (5.5a) through (5.5f), provided 0≦t₁ ≦1 and 0≦t₂ ≦1. If t₁ and t₂ are outside their respective regions the roots are rejected, since such points will not lie between P and P on the generator line ₁ ^(m) ψ₁ (P, P; ψ_(p)).

The next step is to determine whether or not the points R_(l), l=0, . . . , K-1 lie either on the intersecting quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). This is achieved by taking each intersection point R_(l) and finding the corresponding values of the parameters s and t on the quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)). The parameter t is obtained from equation (5.7). When the point lies between the two directrics ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P) and ₂ ^(n) γ₅ (U_(i), U_(i+1) ; P), then 0<t<1. The value t(R_(l)) for each intersection point R_(l), l=1, . . . , K is obtained by substituting x=x_(q) when n=3 or 5, y=y_(q) when n=2 or 4, and z=z_(q) when n=1 or 6 into equation (5.7), where (x_(q),y_(q),z_(q)) are the coordinates of the intersection point R_(l). The points R_(l) that produce a t that is not within 0≦t≦1 are rejected.

For the remaining points R_(l) the parameters is obtained from the quadratic equation

    δ.sub.1 s.sup.2 +δ.sub.2 s+δ.sub.3 =0    (5.16a) ##EQU34## where (x.sub.j,8,y.sub.j,8,z.sub.j,8) are the coordinates of the shoulder point P.sub.j,8, which was defined above The coordinates (x.sub.i,y.sub.i,z.sub.i) and (x.sub.i+1,y.sub.i+1,z.sub.i+1) represent the points U.sub.i and U.sub.i+1, respectively. The weights μ.sub.0,μ.sub.1, and μ.sub.2 are obtained by taking a tangent at point P on the quadric curve and finding the arbitrary points A and B on the lines connecting U.sub.i and P.sub.j,8 and U.sub.i+1 and P.sub.j,8, respectively. The weights are determined from the geometry and given by the following equations: ##EQU35## where (x.sub.A,y.sub.A,z.sub.A) and (x.sub.B,y.sub.B,z.sub.B) are the coordinates in the (x,y,z) coordinate system of the points A and B, respectively. It is seen from equation (5.16a) that when (δ.sub.2.sup.2 -4δ.sub.1 δ.sub.3)<0 there is no solution; when (δ.sub.2.sup.2 -4δ.sub.1 δ.sub.3)<0 there is one root s.sub.1 ; and when (δ.sub.2.sup.2 -4δ.sub.1 δ.sub.3)<0 there are two roots s.sub.1 and s.sub.2. In case there are two roots only one of them represents the s parameter value for the point R.sub.l. To accept one of the two roots, each of them is substituted into the following equation: ##EQU36##

One of the roots, either s₁ or s₂, satisfies equation (5.16c). The root that does not satisfy equation (5.16c) is rejected. The root that is accepted provides the parameter s for the intersection point. When the point lies between U_(i) and U_(i+1), then 0<s<1. However, a point that precedes U_(i) will have s<0 and a point that follows U_(i+1) will have s>1. The value s(R_(l)) for each intersection point R_(l), l=0, . . . , K-1 is obtained from equation (5.16a). The points R_(l) that are not within 0≦s≦1 are rejected.

FIG. 62 shows a plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) that intersects a quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) and shares a full intersection line η₁. The plane ₁ ^(m) γ_(s1) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s1),1 (U_(i), U_(i+1), R₀,1, R_(K-1),1 ; ψ_(p)) and ₁ ^(m) χ_(s1),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)). The quadric surface ₂ ^(n) γ_(s5) (U_(i), U_(i+1), U_(i), U_(i+1) ; ψ_(p)) is dissected into the patches ₂ ^(n) χ_(s5),1 (U_(i), U_(i+1), R₀,2, R_(K-1),2 ; ψ_(p)) and ₂ ^(n) χ_(s5),2 (R₀,2, R_(K-1),2, U_(i), U_(i+1) ; ψ_(p)). The patches ₁ ^(m) χ_(s1),2 (R₀,1, R_(K-1),1, U_(i), U_(i+1) ; ψ_(p)) and ₂ ^(n) χ_(s5),2 (R₀,2, R_(K-1),2, U_(i), U_(i+1) ; ψ_(p)) are removed since they are inside the cavity. The plane and the intersecting quadric surface are then given by, respectively,

    .sub.1.sup.m γ.sub.s1 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.1.sup.m χ.sub.s1,1 (U.sub.i,U.sub.i+1,R.sub.0,1,R.sub.K-1,1 ;ψ.sub.p)    (5.17a)

    .sub.2.sup.n γ.sub.s5 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.2.sup.n χ.sub.s5,1 (U.sub.i,U.sub.i+1,R.sub.0,2,R.sub.K-1,2 ;ψ.sub.p)    (5.17b)

A general expression for a plane _(v) ^(n) γ(U_(i), U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(s1),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(se), is given by equation (5.12). A general expression for a quadric surface _(v) ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(s5),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . , N_(sq), is given by ##EQU37## where N_(sq) is the number of patches that are retained. Also, A'_(o) =U_(i), A'_(o) =U_(i),A'_(N)˜.sbsb.sq =U_(i+1), and and A'_(N)˜.sbsb.sq =U₁₊₁.

The special case when the plane ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is tangential to the quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is shown in FIG. 63. In this case the intersection curve η₁ is the tangent line that is parallel to a generator line ₂ ^(n) ψ₁. A tangential intersection curve is rejected. For each intersection curve a comparison is made to determine whether or not it is tangent to the intersecting surface. If it is tangent, it is rejected. However, the quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) intersects with other surfaces ₁ ^(m) γ_(si) and has other intersection curves η₂ and η₃.

The combination II₃ denotes intersections between a plane γ_(s1) and one of the cylindrical surfaces γ_(sk), k=2,3,4. The combination II₃ is treated in a manner similar to that used for the combination II₂. The implicit expressions for the plane ₁ ^(m) γ_(s1) on face m is given by equation (5.2a), whereas one of the cylindrical surface ₂ ^(n) γ_(sk) on face n in the (x,y,z) coordinate system is given by ##EQU38##

The coefficients ₂ ^(n) G_(jb) ₂ ^(n) H_(jb) ₂ ^(n) J.sbsb.jk and ₂ ^(n) K_(jk) are given by equations (3.16). Equation (5.19) describes a general implicit cylindrical surface in the (x,y,z) system of (FMEM)₃. This equation is considerably simplified when the cylindrical surface is oriented parallel to one of the three axes of the (x,y,z) coordinate system. The simplified equations for the three cases are given below.

When the surface is parallel to the z-axis (n=1 or n=6):

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=x.sup.2 +y.sup.2 +2.sub.2.sup.n G.sub.jk x+2.sub.2.sup.n H.sub.jk y+.sub.2.sup.n K.sub.jk =0                       (5.20a)

When the surface is parallel to the y-axis (n=2 or n=4):

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=x.sup.2 +z.sup.2 +2.sub.2.sup.n G.sub.jk x+2.sub.2.sup.n J.sub.jk z+.sub.2.sup.n K.sub.jk =0                       (5.20b)

When the surface is parallel to the x-axis (n=3 or n=5):

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=y.sup.2 +z.sup.2 +2.sub.2.sup.n H.sub.jk y+2.sub.2.sup.n J.sub.jk z+.sub.2.sup.n K.sub.jk =0                       (5.20c)

Substituting the appropriate equation from the set of equations (5.5a) through (5.5f) into the correspondingly appropriate equation from equations (5.20a) through (5.20c) yields the quadratic equation (5.15), where the coefficients are now given by ##EQU39##

Solving for t for a specific value of s in equation (5.15) gives the values t₁ and t₂. The plane ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) do not intersect at that value of the parameters where δ₂ ² -4δ₁ δ₃ <0. Furthermore, there is only one root t₁ for that value of the parameter s when δ₂ ² -4δ₁ δ₃ <0. When δ₂ ² -4δ₁ δ₃ >0 the intersection points are R₁ =(x_(g1),y_(g1),z_(g1)) and R₂ =(x_(g2),y_(g2),z_(g2)). The implicit intersection points R₁ and R₂ are obtained by substituting t₁ and t₂ into the appropriate equation from equations (5.5a) through (5.5f), provided that 0≦t₁ ≦1 and 0≦t₂ ≦1. If t₁ and t₂ are outside their respective regions, then the roots are rejected since such points will not lie between P and P on the generator line ₁ ^(m) ψ_(i) (P,P;ψ_(p)).

The next step is to determine whether or not the points R_(l),l=0, . . . ,K-1 are on the intersecting cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). This is achieved by taking each intersection point R₁ and finding the values of the parameters s and t for that point on the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The parameter t is obtained from equation (5.7). When the point lies between the two directrics ₂ ^(n) γ_(k) (U_(i),U_(i+1) ;P) and ₂ ^(n) γ_(k) (U_(i),U_(i+1) ;P) then 0<t<1. The value t(R_(l)) for each intersection point R_(l), l=0, . . . ,K-1 is obtained by substituting x=x_(g) when n=3 or 5, y=y_(g) when n=2 or 4, and z=z_(g) when n=1 or 6 into equation (5.7), where (x_(g),y_(g),z_(g)) are the coordinates of the intersection point R_(l). The points R_(l) that produce a t that is not within 0<t<1 are rejected.

For the remaining points R_(l), as shown in FIG. 64, the angle θ from the ξ₁ -axis to the point R_(l) is calculated using the following parametric relations:

    ξ.sub.1 =ξ.sub.1c +r cosθ                      (5.21a)

    ξ.sub.2 =ξ.sub.2c +r sinθ                      (5.21b)

For n=1 or n=6,

ξ₁ =x_(g)

ξ₂ =y_(g)

For n=3 or n=5,

ξ₁ =y_(g)

ξ₂ =z_(g)

For n=2 or n=4,

ξ₁ =z_(g)

ξ₂ =x_(g)

Using equations (5.21), the angles θ_(i) and θ_(i+1) are calculated at points U_(i) and U_(i+1), respectively. When the point lies between U_(i) and U_(i+l), then θ_(i) <θ<θ_(i+1). A point that precedes U_(i) will have θ<θ_(i) and a point that follows U_(i+1) will have θ>θ_(i+1). The value θ(R_(l)) for each intersection point R_(i), l=1, . . . ,K is obtained from equations (5.21). The points R_(l) that are not within θ_(i) ≦θ≦θ_(i+1) are rejected.

FIG. 65 shows a plane ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that intersects a cylindrical surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and shares a full intersection line η₁. The plane ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s1),1 (U_(i),U_(i+1),R₀,1,R_(K-1),1 ;ψ_(p)) and ₁ ^(m) χ_(s1),2 (R₀,1,R_(k-1),1,U_(i),U_(i+1) ;ψ_(p)). The cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₂ ^(m) χ_(sk),1 (U_(i),U_(i+1),R₀,2,R_(K-1),2 ;ψ_(p)) and ₂ ^(n) χ_(sk),2 (R₀,2,R_(k-1),2,U_(i),U_(i+1) ;ψ_(p)). The patches ₁ ^(m) χ_(s1),2 and ₂ ^(n) χ_(sk),2 are removed since they are inside the cavity. The plane and the cylindrical surfaces are given by, respectively,

    .sub.1.sup.m γ.sub.s1 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.1.sup.m χ.sub.s1,1 (U.sub.i,U.sub.i+1,R.sub.0,1,R.sub.K-1,1 ;ψ.sub.p)    (5.22a)

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.2.sup.n χ.sub.sk,1 (U.sub.i,U.sub.i+1,R.sub.0,2,R.sub.K-1,2 ;ψ.sub.p)    (5.22b)

A general expression for a plane _(v) ^(n) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and a quadric surface _(v) ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that are dissected into the patches χ_(s1),j (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(se) and χ_(s5),i A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sq) are given by equations (5.12) and (5.18), respectively. A general expression for a cylindrical surface _(v) ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(sk),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sg), is given by ##EQU40## where N_(sg) is the number of patches that are retained. Also, A'_(o) =U_(i),A'_(o) =U_(i), A'_(N).sbsb.sg =U_(i+1), and A'_(N).sbsb.sg =U_(i+1).

The combination II₄ denotes the orthogonal intersection of a quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) with one of the cylindrical surfaces ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), k=2,3,4. To determine whether or not these two surfaces intersect we use Sylvester's determinant. The quadric surface ₁ ^(m) γ_(s5) is given by equation (5.13) and each of the cylindrical surfaces ₂ ^(n) γ_(sk) is given by equation (5.19). Equations (5.13) and (5.19) are simplified for various cases, and are given by equations (5.14) and (5.20), respectively. Rearranging these equations and writing Sylvester's determinants for each case, we get: ##EQU41##

It is noted that |R₁₂,x |₄ =|R₆₄,x |₄, |R₁₃,y |₄ =|R₅₆,y |₄, |R₂₁,x |₄ =|R₄₆,x |₄, |R₂₃,z |₄ =|R₄₅,z |₄, |R₃₁,y |₄ =|R₅₆,y |₄ and |R₃₂,z |₄ =|R₅₄,z |₄. Each of these twelve determinants has been denoted by |R_(ij),ξ |₄, i=1, . . . ,6, j=1, . . . 6, ξ=x,y or z and i≠j. The coordinate ξ is one of the three coordinates, and the determinant |R_(ij),ξ |₄ is a function of the remaining two coordinates. For example, the determinant |R₁₂,x |₄ is expressed as a function of y and z, whereas the determinant |R₂₃,z |₄ is a function of x and y. One of these two remaining coordinates indicates the depth of the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and the other represents the depth of the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). Which coordinate goes with which surface depends on the values of m and n.

The determinant |R_(ij),ξ |₄ vanishes when the two polynomials given by equations (5.13) and (5.19) have common roots, that is, when the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) intersects the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The determinant |R_(ij),ξ |₄ is, therefore, used to determine whether or not the quadric surface and the cylindrical surface intersect.

Consider the case when the quadric surface ₁ ¹ γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), which exists on face m=1 (the xy-plane), is intersected by an orthogonal cylindrical surface ₂ ² γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), where the cylindrical surface exists on face n=2 (the xz-plane). The approprate determinant for this case is |R₁₂,x |₄ and is given by equation (5.24a). Note that the determinant |R₁₂,x |₄ is a function of y and z only, and is independent of x. The coordinate z indicates the depth of the quadric surface ₁ ¹ γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), whereas the coordinate y represents the depth of the cylindrical surface ₂ ² γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The points ₁ ¹ U_(i) and ₁ ¹ U_(i+1) are the end points of the directric curve ₁ ¹ γ_(s5) (U_(i),U_(i+1) ;P) of the quadric surface ₁ ¹ γ_(s5). The coordinates of the point ₁ ¹ U_(i+1) are (x_(i),y_(i),0) and that of point ₁ ¹ U_(i+1) are (x_(i+1) y_(i+1),0) in the (x,y,z) system. The value of |R₁₂,x |₄ given by equation (5.24a) is calculated at y=y_(i), and its sign is noted. Then y is increased by a small value and the value of |R₁₂,x |₄ is again calculated. Any change in sign of the determinant |R₁₂,x |₄ indicates that it is singular between the last value of y and the new value of y. When this is the case these two values of y are stored for use later to find the roots more precisely. If there is no sign change, y is incremented and the comparison process is repeated until the maximum value y=y_(i+1) is reached. If there is no change in sign of |R₁₂,x |₄ throughout the range y_(i) ≦y≦y_(i+1), the value of |R₁₂,x |₄ is calculated atz=zj and its sign is noted. Then z is increased by a small value and the value of |R₁₂,x |₄ is again calculated. Any change in sign of the determinant |R₁₂,x |₄ indicates that it is singular between the last value of z and the new value of z. When this is the case these two values of z are stored for use later to find the roots more precisely. If there is no sign change, z is incremented and the comparison process is repeated until the maximum value z=z_(i+1) is reached. If there is no change in sign of |R₁₂,x |₄ throughout the range z_(i) ≦z≦z_(i+1), then the quadric surface ₁ ¹ γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) does not intersect the cylindrical surface ₂ ² γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)).

Once the range of intersection is determined, the intersection points are determined by solving equations (5.13) and (5.19). To solve these two equations, the quadric surface ₁ ^(m) γ_(s5) is represented in parametric space (s,t) such that the surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is given by a generator line ₁ ^(m)ψ₅ (P,P;t) and the directric quadric curve ₁ ^(m) γ₅ (U_(i),U_(i+1) ;s) as shown in FIG. 66. The intersections of the generator line ₁ ^(m) ψ₅ (P,P;t) with the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) are considered over the range 0≦s≦1. An arbitrary point ₁ ^(m) ψ_(p) =(x_(p),y_(p),z_(p)) on the generator line is related to the points P and P by equation (5.1). The point P is an arbitrary point that exists on the directric curve ₁ ^(m) γ₅ (U_(i),U_(i+1) ; s), and the point P is another arbitrary point that exists on the other end of the generator ₁ ^(m) ψ₅ (P,P;t) on the other directric curve ₁ ^(m) γ₅ (U_(i),U_(i+1) ;s). The points P and P on the quadric curve are given by, respectively, ##EQU42## The weights μ₀, μ₁ and μ₂ are given by equation (5.16b). The shoulder point P_(j),8 =(x_(j),8,y_(j),8 z_(j),8) was defined above. The depth d₁ is the depth of the profile. When P=U_(i) and P=U_(i), the generator line is at its initial position of s=0; and when P=U_(i+1) and P=U_(i), the generator line is at its final position s=1. Also, when =0, Up =P, and when t=1, ip =P.

The general quadric surface ₁ ^(m) y_(s5), m=1, . . . ,6 represents a surface whose directric curve ₁ ^(m) γ₅ exists on one of the six faces of the (FMEM)₁. Substituting equations (5.25) and (5.26) into equation (5.1), and then simplifying the results for each of the six cases in the (;y,z) coordinate system of (FMEM)₃, yields: ##EQU43## where, (x₀ y₀ z₀) are the coordinates of the origin of the local (x,y,z) system of (FMEM)₃ in the global coordinate system (X,Y,Z), and U=U₃ +x₀, V=V₃ +y₀ and W=W₃ +z₀. The dimensions U₃, V₃, and W₃ are the size of (FMEM)₃ in the X, Y and Z directions, respectively. The coordinates (₁ ^(m) x_(i), ₁ ^(m) y_(i), ₁ ^(m) z_(i)) and (₁ ^(m) X_(i+1), ₁ ^(m) y_(i+1), ₁ ^(m) z_(i+1)) represent the end points ₁ ^(m) U_(i) and ₁ ^(m) U_(i+1) of a quadric curve ₁ ^(m) y₅ (U_(i) i, U_(i+1) ;P), respectively, in the (x,y,z) coordinate system, and d₁ is the depth of the profile shell ₁ ^(m) S_(s)σ (ψ_(p)).

Substituting an appropriate set of equations from equations (5.27a) through (5.27f) into the correspondingly appropriate equation from equations (5.20a) through (5.20c) yields the following quadratic equation in t: ##EQU44##

Solving for t in equation (5.28) gives the values t₁ and t₂ for a specific value of s. The quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), and the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) do not intersect at that value of parameter s when δ₂ ² -4δ₁ δ₃ <0. Furthermore, there is only one root t₁ for that value of the parameter s when δ₂ ² -4δ₁ δ₃ <0. When δ₂ ² -4δ₁ δ₃ <0 the intersection points are R₁ =(x_(qg1),y_(qg1),z_(qg1)) and R₂ =(x_(qg2),y_(qg2),z_(qg2)). The implicit intersection points R₁ and R₂ are obtained by substituting t₁ and t₂ into the appropriate equation from the set of equations (5.27a) through (5.27f), provided that 0<t₁ <1 and 0<t₂ <1. If t₁ and t₂ are outside their respective regions, then the roots are rejected, since such points will not lie between P and P on the generator line ₁ ^(m) ψ_(i) (P,P;ψ_(p)).

The next step is to determine whether or not the points R_(l), l=0, . . . ,K-1 are on the intersecting cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)).

FIG. 67 shows the intersection of the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) with one of the cylindrical surfaces ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The two surfaces share a full intersection curve η₁, which is a fourth order curve. The quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s5),1 (U_(i),U_(i+1),R₀,1,R_(K-1),1 ;ψ_(p)) and ₁ ^(m) χ_(s5),2 (R₀,1,R_(k-1),1,U_(i),U_(i+1) ;ψ_(p)). The cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₂ ^(n) χ_(sk),1 (U_(i),U_(i+1),R₀,2,R_(K-1),2 ;ψ_(p)) and ₂ ^(n) χ_(sk),2 (R₀,2,R_(k-1),2,U_(i),U_(i+1) ;ψ_(p)). The patches ₁ ^(m) χ_(s5),2 and ₂ ^(n) χ_(sk),2 are removed since they are inside the cavity. The quadric and the intersecting cylindrical surfaces are then given by, respectively,

    .sub.1.sup.m γ.sub.s5 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.1.sup.m χ.sub.s5,1 (U.sub.i,U.sub.i+1,R.sub.0,1,R.sub.K-1,1 ;ψ.sub.p)    (5.29a)

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.2.sup.n χ.sub.sk,1 (U.sub.i,U.sub.i+1,R.sub.0,2,R.sub.K-1,2 ;ψ.sub.p)    (5.29b)

A general expression for a quadric surface _(v) ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(s5),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sq) is given by equation (5.18). A general expression for a cylindrical surface _(v) ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(sk),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sg), is given by equation (5.23).

The combination II₅ denotes the orthogonal intersection of two cylindrical surfaces ₁ ^(m) γ_(sk), and ₂ ^(n) γ_(sk), k=2,3,4. To determine whether or not these two surfaces intersect we use Sylvester's determinant. The implicit forms for each of the two surfaces ₁ ^(m) γ_(sk) and ₂ ^(n) γ_(sk) is given by equation (5.19). The simplified forms of the equation for various cases are given by equations (5.20a) through (5.20c). Rearranging these situations and writing Sylvester's determinant for each case, we get: ##EQU45##

It is noted that |R₂₁,x |₅ =|R₁₂,x |₅, |R₃₁,y |₅ =|R₁₃,y |₅, |R₃₂,z |₅ =|R₂₃,z |₅,since the surfaces are cylindrical surfaces. It is also noted that |R₁₂,x |₅ =|R₆₄,x |₅, |R₁₃,y |₅ =|R₆₅,y |₅, |R₂₁,x |₅ =|R₄₆,x |₅, |R₂₃,z |₅ =|R₄₅,z |₅, |R₃₁,y |₅ =|R₅₆,y |₅ and |R₃₂,z |₅ =|R₅₄,z |₅. Each of these twelve determinants has been denoted by |R_(ij),ξ |₅, i=1, . . . ,6, j=1, . . . 6, ξ=x,y or z and i≠j. The coordinate ξ is one of the three coordinates and the determinant |R_(ij),ξ |₅ is a function of the remaining two coordinates. Each of the two remaining coordinates indicates the depth of one of the two cylindrical surfaces.

The determinant |R_(ij),ξ |₅ vanishes when the two polynomials for two surfaces have common roots, that is, when the cylindrical surface ₁ ^(m) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) intersects the other cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The determinant |R_(ij),ξ |₅ is used to determine whether or not the two cylindrical surfaces intersect.

Once the range of intersections is determined, the intersection points are determined by solving the equation (5.19) for the two intersecting cylindrical surfaces. To do that, the first cylndrical surface ₁ ^(m) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is represented in parametric space (s,t). The intersections of the generator line ₁ ^(m) ψ_(k) (P,P;t) with the cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) are determined for 0≦s≦1. An arbitrary point ₁ ^(m) ψ_(p) =(₁ ^(m) x_(p),₁ ^(m) y_(p),₁ ^(m) z_(p)) on the generator line is related to the points P and P by equation (5.1). Referring to FIG. 64, the point P on a circular curve is given by

    ξ.sub.1 =.sub.1.sup.m ξ.sub.1c +.sub.1.sup.m r cos(2πs+.sub.1.sup.m θ.sub.i)                    (5.31a)

    ε.sub.2 =.sub.1.sup.m ξ.sub.2c +.sub.1.sup.m r sin(2πs+.sub.1.sup.m θ.sub.i)                    (5.31b)

For m=1 or m=6.

ξ₁ =x

ξ₂ =y

For m=3 or m=5.

ξ₁ =y

ξ₂ =z

For m=2 or m=4.

ξ₁ =z

ξ₂ =x

The angle ₁ ^(m) θ_(i) is the angle from the ξ₁ -axis to the point U_(i). The coordinates ₁ ^(m) ξ_(1c) and ₁ ^(m) ξ_(2c) are the coordinates of the circular arc ₁ ^(m) γ_(k). The point P is given by

    P=P+d.sub.1                                                (5.32)

The general cylindrical surface ₁ ^(m) γ_(sk), m=1, . . . ,6 represents a surface whose directric curve ₁ ^(m) γ_(k) exists on one of the six faces of (FMEM)₁. Substituting equations (5 31) and (5.32) into equation (5.1), and then simpifying for each of the six cases in the (x,y,z) coordinate system of (FMEM)₃, yields: ##EQU46## where, (x₀,y₀,z₀) are the coordinates of the origin of the local (x,y,z) system of (FMEM)₃ in the global coordinate system (X,Y,Z), and U=U₃ +x₀, V=V₃ +y₀ and W=W₃ +z₀. The dimensions U₃, V₃, and W₃ represent the size of the (FMEM)₃ in the X, Y and Z directions, respectively. The coordinates (₁ ^(m) x_(c),₁ ^(m) y_(c),₁ ^(m) z_(c)) represent the center point of the cylindrical surface ₁ ^(m) γ_(sk) in the (x,y,z) coordinate system, and d₁ is the depth of the profile shell ₁ ^(m) S_(s)σ (ψ_(p)).

Substituting an appropriate set of equations from equations (5.33a) through (5.33f) into the correspondingly appropriate equation from equations (5.20a) through (5.20c) yields the following quadratic equation in t: ##EQU47##

Solving for t in equation (5.34) gives the values t₁ and t₂ for a specific value of s. The cylindrical surfaces ₁ ^(m) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) do not intersect at that value ofthe parameters when δ₂ ² -4δ₁ δ₃ <0. Furthermore, there is onlyone root t₁ for that value of the parameter s when δ₂ ² -4δ₁ δ₃ =0. When δ₂ ² -4δ₁ δ₃ >0 the intersection points are R₁ =(x_(gg1),y_(gg1),z_(gg1)) and R₂ =(x_(gg2),y_(gg2),z_(gg2)). The implicit intersection points R₁ and R₂ are obtained by substituting t₁ and t₂ into the appropriate equation from equations (5.33a) through (5.33f), provided that 0≦t₁ ≦1 and 0≦t₂ <1. If t₁ and t₂ are outside their respective regions, then the roots are rejected, since such points will not lie between P and P on the generator line ₁ ^(m) ψ_(i) (P,P;ψ_(p)).

The next step is to determine whether or not the points R_(l), l=0, . . . ,K-1 are on or the intersecting cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)).

FIG. 68 shows the intersection of cylindrical surface ₁ ^(m) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) with cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The two surfaces share a full intersection curve η₁, which is a fourth order curve. The surface ₁ ^(m) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₁ ^(m) χ_(sk),1 (U_(i),U_(i+1),R₀,1,R_(K-1),1 ;ψ_(p)) and ₁ ^(m) χ_(sk),2 (R₀,1,R_(k-1),1,U_(i),U_(i+1) ;ψ_(p)). The cylindrical surface ₂ ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₂ ^(n) χ_(sk),1 (U_(i),U_(i+1),R₀,2,R_(K-1),2 ;ψ_(p)) and ₂ ^(n) χ_(sk),2 (R₀,2,R_(k-1),2,U_(i),U_(i+1) ;ψ_(p)). The patches ₁ ^(m) χ_(sk),2 and ₂ ^(n) χ_(sk),2 are removed since they are inside the cavity. The two intersecting cylindrical surfaces are then given by, respectively,

    .sub.1.sup.m γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.1.sup.m χ.sub.sk,1 (U.sub.i,U.sub.i+1,R.sub.0,1,R.sub.K-1,1 ;ψ.sub.p)    (5.35a)

    .sub.2.sup.n γ.sub.sk (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.2.sup.n χ.sub.sk,1 (U.sub.i,U.sub.i+1,R.sub.0,2,R.sub.K-1,2 ;ψ.sub.p)    (5.35b)

A general expression for a cylindrical surface _(v) ^(n) γ_(sk) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(sk),1 (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sg),is given by equation (5.23).

The combination II₆ denotes the orthogonal intersections of the quadric surface ₁ ^(m) γ_(s5) with the quadric surface ₂ ^(n) γ_(s5). To determine whether or not these two surfaces intersect we use Sylvester's determinant. Each of the orthogonal quadric surfaces is given by equation (5.13). Equation (5.13) is simplified for various cases and these simplifications are given by equations (5.14a) through (5.14c). Rearranging equations (514a) through (5.14c) and writing Sylvester's determinants for each case, we get: ##EQU48##

It is noted that |R₂₁,x |₆ =|R₁₂,x |₆,|R₃₁,y |₆ =|R₁₃,y |₆, and |R₃₂,z |₆ =|R₂₃,z |₆, since the intersecting surfaces are both quadric surfaces. It is also noted that |R₁₂,x |₆ =|R₆₄,x |₆,|R₁₃,y |₆ =|R₆₅,y |₆, |R₂₁,x |₆ =|R₄₆,x |₆, |R₂₃,z |₆ =|R₄₅,z |₆, |R₃₁,y |₆ =|R₅₆,y |₆ and |R₃₂,z |₆ =|R₅₄,z |₆. Each of these twelve determinants has been denoted by |R_(ij),ξ |₆, i=1, . . . ,6, j=1, . . . 6, ξ=x,y or z and i≠j. The coordinate ξ is one of the three coordinates and the determinant |R_(ij),ξ |₆ is a function of the remaining two coordinates. One of these two remaining coordinates indicates the depth of the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and the other represents the depth of the other quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). Which coordinate goes with which surface depends on the values m and n.

The determinant |R_(ij),ξ |₆ vanishes when the two polynomials for two surfaces have common roots, that is, when the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) intersects the other quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The determinant |R_(ij),ξ |₆ is used to determine whether or not the two quadric surfaces intersect.

To determine the intersection points, the quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is represented in parametric space (s,t) such that the surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is given by a generator line ₁ ^(m) ψ₅ (P, P;t) and the directric quadric curve by ₁ ^(m) γ₅ (U_(i),U_(i+1) ;ψ_(p)) as shown in FIG. 66. The intersections of the generator line ₁ ^(m) ψ₅ (P, P;t) with the other quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) are determined for 0≦s≦1. An arbitrary point ₁ ^(m) ψ_(p) =(₁ ^(m) x_(p),₁ ^(m) y_(p),₁ ^(m) z_(p)) on the generator line is related to the points P and P by equation (5.1). The points P and P on each end of the generat or line ₁ ^(m) ψ₅ (P, P; t) are given by equations (5-25) and (5.26), respectively.

The general quadric surface ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)), m=1, . . . ,6 represents a surface whose directric curve ₁ ^(m) γ₅ (U_(i), U_(i+1) ;ψ_(p)) exists on one of the six faces of (FMEM)₁. Substituting equations (5.25) and (5.26) into equation (5.1) and then simplifyig the result for each of the six cases in the (x,y,z) coordinate system of (FMEM)₃, yields equations (527a) through (5.27f).

Substituting an appropriate set of equations from equations (5.27a) through (5.27f) into the correspondingly appropriate equation from equations (5.14 a) through (5.12c) yields the following quadratic equation in t: ##EQU49## where, (x₀,y₀,z₀) are the coordinates of the origin of the local (x,y,z) system of (FMEM)₃ in the global coordinate system (X,Y,Z), and U=U₃ +x₀,V=V₃ +y₀ and W=W₃ +z₀. The dimensions U₃, V₃, and W₃ are the size of (FMEM)₃ in the X, Yand Z directions, respectively. The coordinates (₁ ^(m) X_(i),₁ ^(m) Y_(i),₁ ^(m) Z_(i)) and (₁ ^(m) X_(i+1),₁ ^(m) Y_(i+1),₁ ^(m) Z_(i+1)) represent the end points ₁ ^(m) U_(i) and ₁ ^(m) U_(i+1) of the quadric curve ₁ ^(m) γ₅ (U_(i),U_(i+1) ;P), respectively, in the (x,y,z) coordinate system, and d₁ is the depth of the profile shell ₁ ^(m) S_(s)σ (ψ_(p)).

Solving for t in equation (5.37) gives the values t₁ and t₂ for a specific value of s. The quadric surfaces ₁ ^(m) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) do not intersect at that value of parameter s when δ₂ ² -4δ₁ δ₃ <0. Furthermore, there is only one root t₁ for that value of the parameter s when δ₂ ² -4δ₁ δ₃ =0. When δ₂ ² -4δ₁ δ₃ >0 the intersection points are R₁ =(x_(qq1),y_(qq1),z_(qq1)) and R₂ =(x_(qq2),y_(qq2),z_(qq2)). The implicit intersection points R₁ and R₂ are obtained by substituting t₁ and t₂ into the appropriate equation from equations (5.27a) through (5.27f), provided that 0≦t₁ ≦1 and 0≦t₂ ≦1. If t₁ and t₂ are outside their respective regions, then the roots are rejected, since such points will not lie between P and P on the generator line ₁ ^(m) ψ_(i) (P,P;ψ_(p)).

The next step is to determine whether or not the points R_(l), l=0, . . . ,K-1 are on the intersecting quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)).

FIG. 69 shows the intersection of two quadric surfaces ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)). The two surfaces share a full intersection curve η₁, which is a fourth order curve. The surface ₁ ^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₁ ^(m) χ_(s5),1 (U_(i),U_(i+1),R₀,1,R_(K-1),1 ;ψ_(p)) and ₁ ^(m) χ_(s5),2 (R₀,1,R_(k-1),1,U_(i),U_(i+1) ;ψ_(p)). The quadric surface ₂ ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) is dissected into the patches ₂ ^(n) χ_(s5),1 (U_(i),U_(i+1),R₀,2,R_(K-1),2 ;ψ_(p)) and ₂ ^(n) χ_(s5),2 (R₀,2,R_(k-1),2,U_(i),U_(i+1) ;ψ_(p)). The patches ₁ ^(m) χ_(s5),2 and ₂ ^(n) χ_(s5),2 are removed since they are inside the cavity. The two intersecting quadric surfaces are then given by, respectively,

    .sub.1.sup.m γ.sub.s5 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.1.sup.m χ.sub.s5,1 (U.sub.i,U.sub.i+1,R.sub.0,1,R.sub.K-1,1 ;ψ.sub.p)    (5.38a)

    .sub.2.sup.n γ.sub.s5 (U.sub.i,U.sub.i+1,U.sub.i,U.sub.i+1 ;ψ.sub.p)=.sub.2.sup.n χ.sub.s5,2 (U.sub.i,U.sub.i+1,R.sub.0,2,R.sub.K-1,2 ;ψ.sub.p)    (5.38b)

A general expression for a quadric surface _(v) ^(n) γ_(s5) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) that is dissected into the patches χ_(s5),i (A'_(i-1),A'_(i),A'_(i-1),A'_(i) ;ψ_(p)), i=1,2, . . . ,N_(sq) is given by equation (5.18).

There are three situations that have to be considered, either: (a) the orthogonal containers of profile shells F_(s)α and F_(s)β do not intersect with each other (denoted Ω_(s1)); (b) the containers F_(s)α and F_(s)β intersect but the profile shells .sub.α^(m) S_(s)σ (ψ_(p)) and .sub.β^(n) S_(s)σ (ψ_(p)) do not intersect (denoted Ω_(s2)); or (c) the containers F_(s)α and F_(s)β intersect and the profile shells .sub.α^(m) S_(s)σ (ψ_(p)) and .sub.β^(n) S_(s)σ (ψ_(p)) intersect (denoted Ω_(s3)) The resulting profiles of case (a) are then given by equation (3.18). This case will not be discussed further. When two containers F_(s)α and F_(s)β intersect each other in a common volume F_(s)αβ they are surrounded by another container F_(s)ω, such that the two shells .sub.α^(m) S_(s)σ (ψ_(p)) and .sub.β^(n) S_(s)σ (ψ_(p)) are included in the new container F_(s)ω. The new container F_(s)ω forms a new entity (FMEM).sub.ω. The resulting profiles for cases (b) and (c) are now discussed.

Consider the case when the two shells .sub.α^(m) S_(s)σ (ψ_(p)) and .sub.β^(n) S_(s)σ (ψ_(p)) σ=I or C, do not intersect in F_(s)ω. In the most general case, the profile of the newly formed profile .sub.Ω.sbsb.s2^(mm) S_(sF) (ψ_(p)), is given by ##EQU50## where the shells .sub.α^(m) S_(s1) (ψ_(p)) and .sub.α^(m) S_(sC) (ψ_(p)) represent an island and its surrounding cavity, respectively, of (FMEM).sub.α and the shells .sub.β^(n) S_(s1) (ψ_(p)) and .sub.β^(n) S_(sC) (ψ_(p)) represent an island and its surrounding cavity, respectively, of (FMEM).sub.β. Each of these profile shells is given by the appropriate implementation of equation (3.18). The subscript F denotes that the resulting profile defines a profile, and Ω_(s2) indicates that none of the surfaces in F_(s)ω intersects.

There are three cases of intersections of two orthogonal cavities. The first case is when a cavity .sub.α^(m) S_(sC) (ψ_(p)) intersects another cavity .sub.β^(n) S_(sC) (ψ_(p)). The second case is when a cavity .sub.α^(m) S_(sC) (ψ_(p)) intersects an island .sub.β^(n) S_(s1) (ψ_(p)). The case of an island .sub.α^(m) S_(s1) (ψ_(p)) intersecting another island .sub.β^(n) S_(s1) (ψ_(p)) is not physically realizable. Mathematically, the case of an island .sub.α^(m) S_(s1) (ψ_(p)) intersecting a cavity .sub.β^(n) S_(sC) (ψ_(p)) and the case of a cavity .sub.α^(m) S_(sC) (ψ_(p)) intersecting an island .sub.β^(n) S_(s1) (ψ_(p)) are the same. However, an island does not exist without a surrounding cavity; therefore, the intersection of an island with another cavity cannot be described without also considering the intersection of its surrounding cavity. Consequently, there are a total of three combinations of intersections possible. These are described below.

Referring to FIG. 70, the first combination of intersections is when a cavity .sub.α^(m) S_(sC) (ψ_(p)) intersects cavity .sub.β^(n) S_(sC) (ψ_(p)). The two intersecting cavity surfaces form a new cavity .sub.ω^(mn) S_(sCC) (ψ_(p)). The two island shells .sub.α^(m) S_(s1) (ψ_(p)) and .sub.β^(n) S_(s1) (ψ_(p)) remain intact and are given in their general form by equation (3.18). The resultant profile .sub.Ω.sbsb.s3^(mn) S_(sF) (ψ_(p)) is

    .sub.Ω.sbsb.s3.sup.mn S.sub.sF (ψ.sub.p)=.sub.ω.sup.mn S.sub.sCC (ψ.sub.p)+.sub.α.sup.m S.sub.s1 (ψ.sub.p)+.sub.β.sup.n S.sub.s1 (ψ.sub.p)    (5.40)

Referring to FIG. 71, the second combination of intersections is when a cavity .sub.β^(n) S_(sC) (ψ_(p)) intersects the cavity .sub.α^(m) S_(sC) (ψ_(p)) as well as the island .sub.α^(m) S_(s1) (ψ_(p)). The two intersecting cavities again form a new cavity .sub.ω^(mn) S_(sCC) (ψ_(p)), and the modification to the island shell .sub.α^(m) S_(s1) (ψ_(p)) is denoted .sub.α^(m) S_(s1) (ψ_(p)). The island shell .sub.β^(n) S_(s1) (ψ_(p)) is not affected. The resultant profile .sub.Ω.sbsb.s3^(mn) S_(sF) (ψ_(p)) is then

    .sub.Ω.sbsb.s3.sup.mn S.sub.sF (ψ.sub.p)=.sub.ω.sup.mn S.sub.sCC (ψ.sub.p)+.sub.α.sup.m S.sub.s1 (ψ.sub.p)+.sub.β.sup.n S.sub.s1 (ψ.sub.p)    (5.41)

When the cavity .sub.β^(n) S_(sC) (ψ_(p)) eliminates the island .sub.α^(m) S_(s1) (ψ_(p)). In that case, equation (5.41) is reduced to

    .sub.Ω.sbsb.s3.sup.mn S.sub.sF (ψ.sub.p)=.sub.ω.sup.mn S.sub.sCC (ψ.sub.p)+.sub.β.sup.n S.sub.s1 (ψ.sub.p)(5.42)

As shown in FIG. 72, the last combination modifies the two cavities .sub.α^(m) S_(sC) (ψ_(p)) and .sub.β^(n) S_(sC) (ψ_(p)) to form a new cavity .sub.ω^(mn) S_(sCC) (ψ_(p)). The two islands .sub.α^(m) S_(s1) (ψ_(p)) and .sub.β^(n) S_(s1) (ψ_(p)) are modified to .sub.α^(m) S_(sC) (ψ_(p)) and .sub.β^(n) S_(s1) (ψ_(p)), respectively. The resultant profile .sub.Ω.sbsb.s3^(mn) S_(sF) (ψ_(p)) is then

    .sub.Ω.sbsb.s3.sup.mn S.sub.sF (ψ.sub.p)=.sub.ω.sup.mn S.sub.sCC (ψ.sub.p)+.sub.α.sup.m S.sub.s1 (ψ.sub.p)+.sub.β.sup.n S.sub.s1 (ψ.sub.p)    (5.43)

The modified island shells .sub.α^(m) S_(sC) (ψ_(p)) and .sub.β^(n) S_(s1) (ψ_(p)) are determined in the manner discussed above.

In order to determine the resulting shape of the cavities after the orthogonal intersection of two cavities, it is first necessary to form a maximum rectangular prismatic volume, called the greatest volume (GV). This volume contains maximum of three pairs of orthogonally oriented cavities (FMEMs) that are either intersecting or not intersecting. The algorithm for the determination of the orthogonally intersecting cavities determines the resulting intersetion curves from the intersection of pairs of orthogonally positioned cavities. However, the algorithm does not evaluate the intersection of any three orthogonally intersecting cavities. The extension of the algorithm to determine the intersection of three orthogonally intersecting cavities is left for future work. In this section we illustrate how the greatest volumes can be used to determine the orthogonal inetersections of FMEMs.

FIGS. 73 shows examples of the greatest volumes containing several orthogonally positioned FMEMs. FIG. 73 shows three FMEMs on three orthogonal faces of a part. The cavity (FMEM)₃ is orthogonal to the XY-plane, and is assumed to be resulted from a 2D intersection of two FMEMs on this plane. For this case, some of the boundaries of the greatest volume that contains the three FMEMs coincide with the boundaries of the part. The part is comprised of only one greatest volume, which in turn contains three pairs of orthogonal FMEMs, each of which resides on a different face of the GV. FIG. 74 shows eight FMEMs, (FMEM)₁, . . . ,(FMEM)₈ on a part. There are six greatest volumes (GV)₁, . . . ,(GV)₆ for this case, such that only one FMEM resides on each face of a greatest volume. The volume (FMEM)₆ is comprised of multiple profiles that resulted from their 2D intersections on a plane. However, (FMEM)₆ is considered a single FMEM for determination of greatest volume (GV)₆. The volume (FMEM)₂ exists on a plane Z=d₁, where d₁ is the depth of (FMEM)₁. Volumes (GV)₄ and (GV)₆ contain a pair of orthogonal FMEMs, whereas (GV)₃ contains only (FMEM)₈ and (GV)₅ contains no FMEM.

Once determined, the greatest volumes are used in the algothirm of orthogonal intersection of FMEMs. A part is considered as a collection of the greatest volumes. Each greatest volume may contain only one FMEM on each of its six faces. This FMEM may intersect other FMEMs on two orthogonal faces of the greatest volume. The intersection of each pair of orthogonal FMEMs within each greatest volume is determined. The pseudo code for determining such intersections in a greatest volume is described in the following section.

The pseudo code for determining the orthogonal intersections of pairs of orthogonal profile shells on N_(GV) greatest volumes (GVs) is presented. The algorithm takes a greatest volume from a total number of N_(GV) greatest volumes and determines the number of FMEMs it contains. If a greatest volume contains one or no FMEM, the algorithm looks at the next greatest volume until it finds a greatest volume that contains more than one FMEM. It then proceeds to determine the planes on which two of the FMEMs exist. The pair (FMEM).sub.α and (FMEM).sub.β are further processed only if they are orthogonal to each other.

The orthogonal intersections of the profile shells .sub.α^(m) S_(s)σ (ψ_(p)), α=1, . . . ,N_(v) on a plane m with profile shell .sub.β^(n) S_(s)σ (ψ_(p)), β=α+1, . . . N_(v) on an orthogonal plane n are then determined. Each of the N_(v) profile shells is enclosed by their respective containers. The first part of the algorithm takes a container from the total number of N_(v) containers on a plane m and determines if it intersects a container F_(s)β from the remaining containers on an orthogonal plane n. Each container F_(s)α is checked to determine whether or not it intersects another container F_(s)β. The logicals O.sub.α and I.sub.α indicate the status of F_(s)α ; the former indicates whether or not the containers intersect and the latter indicates whether or not the profile shell .sub.α^(m) S_(s)σ (ψ_(p)) orthogonally intersect shell .sub.β^(n) S_(s)σ (ψ_(p)).

If two containers are not intersecting, that is, they have an Ω_(s1) relationship, then the algorithm takes another container from the N_(v) containers and determines if it intersects F_(s)α. If none of the containers from the N_(v) containers intersects the container F_(s)α, it remains an independent FMEM, and the logicals I.sub.α and O.sub.α are set to false. However, if an intersected container F_(s)β is found, then the logical O.sub.α is set to true and the two intersecting containers are enclosed by another container F_(s)ω,ω>N_(v). Then a common volume F_(s)αβ is determined within F_(s)ω. The surfaces of the two profile shells .sub.α^(m) S_(s)σ (ψ_(p)) and .sub.β^(n) S_(s)σ (ψ_(p)) are examined to determine whether or not they lie within F_(s)αβ. If none of the surfaces lie within F_(s)αβ, that is, they have an Ω_(s2) relationship, then the resultant profile is given by .sub.Ω.sbsb.s2^(mn) S_(sF) (ψ_(p)) [recall equation (5.39)]. If they do intersect, that is, they have an Ω_(s3) relationship, then the algorithm sets the logical I.sub.α to true and proceeds to determine the intersection curves of the two profile shells within F_(s)αβ.

Assume that it has been determined that n₁ surfaces of the shell .sub.α^(m) S_(s)σ (ψ_(p)) and n₂ surfaces of shell .sub.β^(n) S_(s)σ (ψ_(p)) are within the common volume F_(s)αβ. Then, only these surfaces are considered. The algorithm determines the combination type II_(k), k=1, . . . ,6, for the pair of intersecting surfaces .sub.α^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) and .sub.β^(m) γ_(s1) (U_(i),U_(i+1),U_(i),U_(i+1) ;ψ_(p)) For combinations II₄, II₅ and II₆ the algorithm uses the Sylvester's method to determine whether or not the surfaces intersect. If they intersect the roots of (s,t) are found for combinations II₄, II₅ and II₆ by solving equations (5.28), (5.34) and (5,37), respectively. For combinations II₁, II₂ and II₃ the roots are found by solving the equations (5.6), (5.15) and (5.15), respectively. A parametric root that does not lie within the range 0≦t≦0 is rejected. The remaining roots are then converted into implicit intersection points R_(l), l=1, . . .,x by solving either equation (5.5) for combination II₁, II₂ and II₃, equation (5.27) for II₄ and II₆ or equation (5.33) for II₅. The algorithm then calculates the parameter t.sub.β by solving equation (5.7) for each intersection point R_(l) on the surface .sub.β^(n) γ_(si).A point that does not satisf 0≦t.sub.β ≦1 is rejected. For the remaining points the parameter s.sub.β is calculated using either equation (5.8) or (5.16) for a plane or a quadric surface, respectively. The intersection point R_(l) is accepted only if 0≦s.sub.β ≦1. When .sub.β^(n) γ_(si) is a cylindrical surface a parameter θ is calculated using equation (5.21). The value of θ is then compared with the previously calculated values of θ_(i) and θ_(i+1). The intersection point is only accepted if θ_(i) ≦θ≦θ_(i+1). The remaining intersection points for each pair of surfaces .sub.α^(m) γ_(si) and .sub.β^(n) γ_(si) are then represented by an intersection curve η₁. The intersection curves are stored for later processing.

The second part of the algorithm processes each F_(s)α, α=1, . . . ,N_(v), and determines whether or not the shell within F_(s)α has intersected other shells. If the logical I.sub.α is false, the algorithm takes the next container; otherwise it orders the intersection curves on each shell and determines the patches that are to be removed and the ones that are to remain for each surface. The patches of each surface that remain are collected to define the profiles .sub.α^(m) S_(s1) (ψ_(p)) and .sub.α^(m) S_(sC) (ψ_(p)). Once all containers F_(s)α are examined the resulting profiles .sub.Ω.sbsb.s3^(mn) S_(sF) (ψ_(p)) are determined using either equation (5.40), (5.41), (5.42) or (5.43). The process is repeated for each greatest volume that has been formed.

The objective of the algorithm described below is to determine the minimum number of GVs for a given part. The goal is to divide the part into these GVs such that each GV has either no FMEM profile or one FMEM profile on at least one of its surfaces. This goal guarantees that the orthogonal intersection of two FMEMs cavities as detailed in the previous chapter can be determined. These goals are achieved by observing that: (i) each FMEM is represented by its extent, (ii) a through hole is represented by a single extent only on the face where its profile was originally placed, (iii) two or more overlapping extents on the same plane are surrounded by a larger extent and only the larger extent has to be considered, and (iv) either one or no extent will exist on each of the six faces of a GV.

Each extent represents an FMEM. If two FMEMs intersect on a common face of a part then the two extents are enclosed by a larger extent and only the larger extent is considered for this algorithm. An FMEM with a through hole cavity is still represented by a single extent only on the face where its profile was initially considered. It is deduced from these facts that if a through hole cavity intersects with two other cavity profiles on opposite faces of the part then the two FMEMs are represented by two extents on the two opposite faces. The GV determination algorithm relies on extents rather than the profiles contained within the extents. The algorithm processes the extents in a way such that a face of each GV contains one or no extent.

The GVs are determined using bands, which are imaginary strips that surround the part. Each band can be visualized as a ribbon wrapped around the part. The common regions formed by two orthogonal bands on each face of the part will represent the faces of the GVs. It is shown how the bands are formed for a given part and how the bands are used to determine the minimum number of GVs.

An extent is defined by the coordinates of two of its diagonal corners. Consider an extent ^(n) F.sub.α on face n of the part shown in FIGS. 75 through 77. If n=1 or n=6, then its diagonal corners are given by (X_(o),α,Y_(o),α) and (X_(e),α,Y_(e),α) in the global coordinate system. The point (X_(o),α,Y_(o),α) is closest to the origin of the (X,Y,Z) coordinate system, and the point (X_(e),α,Y_(e),α) is the farthest. Thus, X_(o),α and Y_(o),α are the shortest distances from the Y- and X-axes, respectively, and X_(e),α and Y_(e),α are the longest distances from Y- and X-axes, respectively. Similarly, on either face n=2 or n=4 X_(o),α and Z_(o),α are the shortest distances and X_(e),α and Z_(e),α are the longest distances from Z- and X-axes, respectively; on face n=3 or n=5 Y_(o),α and Z_(o),α are the shortest distances, and Y_(e),α and Z_(e),α are the longest distances from Z- and Y-axes, respectively. In each of these six cases we use the shorthand notation of calling the shortest distance ρ_(o),α to represent either X_(o),α, Y_(o),α or Z_(o),α, and the longest distance ρ_(e),α, to represent either X_(e),α, Y_(e),α or Z_(e),α.

To determine the greatest volumes requires that the extents on each plane of the part first be sorted in ascending order, starting with the extent with the smallest value of the distance ρ_(e),α and ending with the extent with the largest value of ρ_(e),α. The distances ρ_(e),α and ρ_(o),α for each extent ^(n) F.sub.α are then used to determine the position of the extent relative to other extents on each face n. The extents on each face n are sorted twice, once for each axis. These ordered extents for each face n and for each axis ρ are stored in the sorted lists L.sub.ρ, where ρ=X, Y and Z, and corresponding to each ρ is the set {n.sub.ρ } where

for ρ=X:

    {n.sub.x }={1,2,4,6}                                       (6.1a)

for ρ=Y:

    {n.sub.y }={1,3,5,6}                                       (6.1b)

for ρ=Z:

    {n.sub.z }={2,3,4,5}                                       (6.1c)

For the two XY faces, n=1 and 6, the sorted lists L.sub.ρ, ρ=X and Y, store the extents ^(n) F.sub.α in ascending order according to the distances X_(e),α and Y_(e),α, respectively; for the two XZ faces, n=2 and 4, the sorted lists L.sub.ρ, ρ=X and Z, store the extents in ascending order according to the distances X_(e),α and Z_(e),α, respectively; and for the YZ faces, n=3 and 5, the sorted lists L.sub.ρ, ρ=Y and Z, store the extents in ascending order according to the distances Y_(e),α and Z_(e),α, respectively.

FIG. 78 shows several extents and their corresponding distances ρ_(e),α on the XY-plane (n=1). For this case the distances ρ_(e),α are measured from the Y-axis. The smallest value of ρ_(e),α is ρ_(e),8 for extent ¹ F₈, and the largest value is ρ_(e),20 for extent ¹ F₂₀. In the sorted list L_(X) for the extents for the X-axis, ¹ F₈ is the first member and ¹ F₂₀ is the last member of the list. The position of each extent in the list is specified by a superscript in paranthesis. Thus, for this example, the sorted list L_(X) is given by,

    L.sub.Z =[.sup.1 F.sub.8.sup.(1), .sup.1 F.sub.3.sup.(2), .sup.1 F.sub.5.sup.(3), .sup.1 F.sub.15.sup.(4), .sup.1 F.sub.20.sup.(5) ](6.2a)

FIG. 79 shows the same extents with their corresponding distances ρ_(e),α which are now measured from the X-axis. The largest value of ρ_(e),α is ρ_(e),15 for extent ¹ F₁₅, and the smallest value is ρ_(e),5 for extent ¹ F₅. In the sorted list L_(Y) for the extents measured from the Y-axis, ¹ F₅ is the first member and ¹ F₁₅ is the last member of the list. Thus,

    L.sub.Y =[.sup.1 F.sub.5.sup.(1), .sup.1 F.sub.20.sup.(2), .sup.1 F.sub.3.sup.(3), .sup.1 F.sub.8.sup.(4), .sup.1 F.sub.15.sup.(5) ](6.2b)

It is noted that an extent may hold different positions in the arrays L_(X) and L_(Y). For example, the extent ¹ F₅ is the third member of L_(X), whereas it appears first in L_(Y).

We now extend this notation. Consider a part with extents on the three different faces shown in FIG. 80. The extents ¹ F₁ and ¹ F₂ exist on face 1, the extents ⁴ F₃ and ⁴ F₅ on face 4 and the extents ⁵ F₄, ⁵ F₆ and ⁵ F₇ on face 5. Imagine that four sides of the part whose planes are perpendicular to one plane are unfolded onto a common plane. Consider the set {n_(x) }, which is unfolded onto a common plane PL_(X). The array L_(X) can then be visualized as an array of the sorted extents that lie on this common plane such that the corresponding ρ_(e),α of each extent appears in ascending order irrespective of the value of n within {n_(x) }. Similarly, the sets {n_(Y) } and {n_(Z) } can be unfolded onto the common planes PL_(Y) and PL_(e), respectively. FIG. 81 through 83 show the extents in FIG. 80 unfolded onto these three common planes. FIG. 81 shows PL_(X), which is obtained by unfolding the set {n_(X) }. The sorted list L_(X) is then an array of extents that lies on the common plane PL_(X) and is given by

    L.sub.X =[.sup.4 F.sub.3.sup.(1), .sup.1 F.sub.2.sup.(2), .sup.4 F.sub.5.sup.(3), .sup.1 F.sub.1.sup.(4) ]=[.sup.n.sbsp.x.sbsp.1 F.sub.α.sbsb.1.sup.(1),.sup.n.sbsp.x.sbsp.2 F.sub.α.sbsb.2.sup.(2),.sup.n.sbsp.x.sbsp.3 F.sub.α.sbsb.3.sup.(3),.sup.n.sbsp.x.sbsp.4 F.sub.α.sbsb.4.sup.(4) ]                            (6.3a)

where the superscript n_(x).sbsb.k is any member of the set {n_(x) }, the subscript α_(k) assumes the appropriate subscript of the extent whose X_(e) has a magnitude that places it in its position in L_(X), and the superscript (k) indicates the extent's location in L_(X). The maximum value of α_(k) is α_(N), where N is the total number of extents on all six sides. The value of k ranges from 1 to K.sub.ρ, where 1 is the position of the first extent and K.sub.ρ is the position of the last extent in the array L.sub.ρ.

In a similar manner we find from FIGS. 82 and 83 that

    L.sub.Y =[.sup.5 F.sub.7.sup.(1), .sup.5 F.sub.4.sup.(2), .sup.1 F.sub.1.sup.(3), .sup.1 F.sub.2.sup.(4), .sup.5 F.sub.6.sup.(5) ]=[.sup.n.sbsp.y.sbsp.1 F.sub.α.sbsb.1.sup.(1),.sup.n.sbsp.y.sbsp.2 F.sub.α.sbsb.2.sup.(2),.sup.n.sbsp.y.sbsp.3 F.sub.α.sbsb.3.sup.(3),.sup.n.sbsp.y.sbsp.4 F.sub.α.sbsb.4.sup.(4) ]                            (6.3b)

    L.sub.Z =[.sup.5 F.sub.6.sup.(1), .sup.4 F.sub.5.sup.(2), .sup.5 F.sub.4.sup.(3), .sup.5 F.sub.7.sup.(4), .sup.4 F.sub.3.sup.(5) ]=[.sup.n.sbsp.z.sbsp.1 F.sub.α.sbsb.1.sup.(1),.sup.n.sbsp.z.sbsp.2 F.sub.α.sbsb.2.sup.(2),.sup.n.sbsp.z.sbsp.3 F.sub.α.sbsb.3.sup.(3),.sup.n.sbsp.z.sbsp.4 F.sub.α.sbsb.4.sup.(4) ]                            (6.3c)

In order to determine the greatest volumes, we introduce the bands B.sub.ρζ. The bands B.sub.ρζ are determined in the following manner from each L.sub.ρ, which contains extents ^(n).sbsp.e.sbsp.k F.sub.α.sbsb.k.sup.(k) for the corresponding set {n.sub.ρ }. Consider two adjacent extents ^(n).sbsp.e.sbsp.i F.sub.α.sbsb.i.sup.(i+1) and ^(n).sbsp.e.sbsp.i+1 F.sub.α.sbsb.i+1.sup.(i+1) in array L.sub.ρ (α_(i) ≠α₁₊₁). The respective positions of ^(n).sbsp.e.sbsp.i F.sub.α.sbsb.i.sup.(i+1) and ^(n).sbsp.e.sbsp.i+1 F.sub.α.sbsb.i+1.sup.(i+1) on the unfolded plane PL.sub.ρ are such that ρ_(e),α.sbsb.i ≦ρ_(e),α.sbsb.i+1. The corresponding values of ρ_(e),α.sbsb.k for the extents ^(n).sbsp.e.sbsp.i F.sub.α.sbsb.i.sup.(i+1) and ^(n).sbsp.e.sbsp.i+1 F.sub.α.sbsb.i+1.sup.(i+1) are ρ_(o),α.sbsb.i and ρ_(o),α.sbsb.i+1, respectively. Let ^(n).sbsp.e.sbsp.P F.sub.α.sbsb.P.sup.(P) be the last extent included in the previous band B.sub.ρζ-1, for ζ>1, such that the boundary of the band B.sub.ρζ-1 is set to ρ_(o),α.sbsb.p+1. With this notation in mind let there be two groups of extents ^(n).sbsp.e.sbsp.p F.sub.α.sbsb.p.sup.(p), 1<p<i+1, and ^(n).sbsp.e.sbsp.q F.sub.α.sbsb.q.sup.(q), i+1<q<≦K.sub.ρ. Thus, ρ_(e),α.sbsb.q is larger than any of the values ρ_(e),α.sbsb.i and smaller than or equal to any of the values ρ_(e),α.sbsb.q. There are two rules that are applied to determine the boundaries of the bands B.sub.ρζ. These rules are a function of the relative magnitude of ρ_(e),α.sbsb.i and ρ_(o),α.sbsb.k, k=i+1, . . . ,K.sub.ρ and are detailed in Table 6.1. Rule 1 is for the case where ρ_(e),α.sbsb.i <ρ_(o),α.sbsb.k, i=1, . . . ,K.sub.ρ -1, k=i+1, . . . ,K.sub.ρ. It sets the final boundary of the band B.sub.ρζ to ρ_(o),α.sbsb.i+1 and includes the extent ^(n).sbsp.e.sbsp.P+1 F.sub.α.sbsb.P+1.sup.(P+1), . . . , ^(n).sbsp.e.sbsp.i F.sub.α.sbsb.i.sup.(i) in the band. Rule 2 applies when ρ_(e),α.sbsb.i ≧ρ_(o),α.sbsb.k, i=1, . . . ,K.sub.ρ -1, k=i+1, . . . ,K.sub.ρ. It sets the final boundary of the band B.sub.ρζ to ρ_(o),α.sbsb.k+1 and includes the extent ^(n).sbsp.e.sbsp.P+1 F.sub.α.sbsb.P+1.sup.(P+1), . . . , ^(n).sbsp.e.sbsp.k F.sub.α.sbsb.k.sup.(k) in the band B.sub.ρζ.

We now illustrate these two rules on the part shown in FIGS. 80 through 83. FIGS. 84 through 86 show the three sets of bands B.sub.ρζ on the three unfolded surfaces PL.sub.ρ, ρ=X,Y,Z. FIG. 84 shows four bands B_(X),1 through B_(X),4 on PL_(X). These bands were determined in the following manner. From equation 6.3(a) the extent closest to the Y-axis on PL_(X) is ⁴ F₃.sup.(1), with ¹ F₂.sup.(2) being the next closest. In this case, the first rule is applicable since X_(e),3 <X_(o),α.sbsb.k, α_(k) =2,5 and 1. Also, since X_(e),3 ≦X_(o),2 ≦X_(o),α.sbsb.q, α_(q) =5 and 1, the band B_(X),1 is formed at X=X_(o),2 and the extentb ⁴ F₃.sup.(1) is included in the band B_(X),1. Therefore, the width of the band B_(X),1 is X_(o),2. Similarly, the other three bands B_(X),2, B_(X),3 and B_(X),4 are formed using Rule 1 in a similar manner. It is found that the widths of these bands are given by X_(o),5 -X_(o),2,X_(o),1 -X_(o),5 and X_(d) -X_(o),1, respectively. The extent ¹ F₂.sup.(2) is in band B_(X),2, extent ⁴ F₅.sup.(3) is in band B_(X),3 and extent ¹ F₁.sup.(4) is in band B_(X),4.

FIG. 85 shows the extents on the common plane PL_(Y). The corresponding array L_(Y) for PL_(Y) is given by equation 6.3(b). Rule 1 is again applied since Y_(e),7 <Y_(o),α.sbsb.k, α_(k) =4, 1 and 2. The second part of Rule 1 requires that a band be formed onlywhen Y_(o),4 >Y_(e),7 and Y_(o),4 ≦Y_(o),α.sbsb.q, α_(q) =1, 2 and 6. However, in this case the latter is not true since Y_(o),4 >Y_(o),2. Therefore, no band is formed at Y=Y_(o),4. The next extent in L_(Y) is ⁵ F₆.sup.(5), which is the array's last member. Thus, the location of the end of the band B_(Y),1 is Y=Y_(d), and the width of B_(Y),1, the only band, is Y_(d).

FIG. 86 shows the common plane PL_(Z). In this case Rule 2 is applicable, since Z_(e),6 >Z_(o),5. The extents ⁵ F₆.sup.(1) and ⁴ F₅.sup.(2) are included in the band B_(Z),1. The next extent is ⁵ F₄.sup.(3). In this case the width of B_(Z),1 is set to Z=Z_(o),4, since Z_(e),α.sbsb.p ≦Z_(o),4 ≦Z_(o),α.sbsb.q, where α_(p) =6 and 5 and α_(q) =7 and 3. The next band B_(Z),2 is also determined using Rule 2, since Z_(e),4 >Z_(o),7. The extents ⁵ F₄.sup.(3) and ⁵ F₇.sup.(4) are included in band B_(Z),2. The next extent is ⁴ F₃.sup.(5). However, no band is formed at Z=Z_(o),3 since Z_(o),4 <Z_(e),7. Instead, the end of the band B_(Z),2 is at Z=Z_(d). Therefore, the width of band B_(Z),2 is Z_(d) -Z_(o),4.

We now fold back the three common planes of FIGS. 84 through 86 to form the original part. FIGS. 87 through 89 show the part with its corresponding bands in the X, Y and Z-directions. Each face now becomes a checker board created when the two sets of bands cross each other orthogonally. Each band B.sub.ρζ is then further broken up into a collection of rectangles B_(e),ζ.sup.(i) such that ##EQU51## where, M.sub.ρζ is the total number of rectangles comprising B.sub.ρζ. It is noted that the rectangles B_(e),ζ.sup.(j) exist on the same four faces of the set {n.sub.ρ } as the corresponding band B.sub.ρζ. Each band B.sub.ρζ is crossed orthogonally by a set of bands on each face n of the set {n.sub.ρ }. The total number of rectangles M.sub.ρζ in B.sub.ρ,ζ is then equal to the sum of the number of the orthogonally intersecting bands on each of the four faces in the set {n.sub.ρ }. Thus,

for ρ=X:

    M.sub.X,ζ =2[N.sub.B,Y +N.sub.B,Z ]                   (6.5a)

for ρ=Y:

    M.sub.Y,ζ =2[N.sub.B,X +N.sub.B,Z ]                   (6.5b)

for ρ=Z:

    M.sub.Z,ζ =2[N.sub.B,X +N.sub.B,Y ]                   (6.5c)

where, N_(B),X, N_(B),Y and N_(B),Z are the total number of X-, Y- and Z-bands, respectively.

Consider B_(X),1 shown in FIG. 87. The corresponding set {n_(X) } is given by equation 6.1(a) and contains the faces 1,2,4 and 6. The band B_(Y),1 is orthogonal to B_(X),1 on faces 1 and 6, whereas B_(Z),1 and B_(Z),2 are the orthogonal bands on faces 2 and 4. From equation (6.5a) M_(X),1 =6. Similarly, it is found that M_(X),2, M_(X),3 and M_(X),4 are also equal to 6. Now consider B_(Y),1, which is intersected by B_(X),1, B_(X),2, B_(X),3 and B_(X),4 on faces 1 and 6 of set {n_(Y) } and by B_(Z),1 and B_(Z),2 on faces 3 and 5. Therefore, M_(Y),1 is 12. From equation (6.5c) it is found that M_(Z),1 =M_(Z),2 =10. FIG. 87 shows the six rectangles in each of the four X-bands B_(X),ζ, ζ=1, . . . , 4. These rectangles are given by B_(X),ζ.sup.(i), j=1, . . . ,6. Similarly, FIG. 88 and FIG. 89 show twelve rectangles in B_(Y),1, and ten rectangles in each of the two Z-bands B_(Z),1 and B_(Z),2, respectively. Each rectangle is defined two ways, one from each of the two orthogonal directions. For example, the rectangle B_(X),1.sup.(1) is the first rectangle of the band B_(X),1, and is the same rectangle as the fourth rectangle B_(Y),1.sup.(4) of the band B_(Y),1.

Two edges of the rectangle B.sub.ρ,ζ.sup.(j) coincide with the band B.sub.ρ,ζ, whereas the other two edges are orthogonal to B.sub.ρζ and are given by the width of the band that crosses B.sub.ρζ orthogonally to form the rectangle B.sub.ρζ.sup.(i). FIG. 87 shows the two edges of the rectangle B_(X),1.sup.(1), which coincide with the band B_(X),1. The two orthogonal edges of B_(X),1.sup.(1) are also shown, and are determined by the width of B_(Y),1. The distances to the two orthogonal edges are used to determine the number of extents N.sub.ρζ.sup.(j) in each rectangle B.sub.ρζ.sup.(j). If the distance to the nearest boundary of an extent ^(n) F.sub.α from the ρ-axs is greater than the distance to the nearest orthogonal edge of the rectangle B.sub.ρζ.sup.(i) and is smaller than the distance to the farthest edge, then the extent ^(n) F.sub.α is inside the rectangle, otherwise it is not. Only those extents that lie within the band B.sub.ρζ are used to determine N_(e)ζ.sup.(i).

Since the overall objective of the method is to insure that no more than one extent resides in each surface of a GV, an additional rule is now required for each rectangle for which N_(e)ζ.sup.(j) >1. The goal is to divide the rectangle into smaller rectangles B_(e)ζ.sup.(j,m), m=1, . . . ,N_(e)ζ.sup.(j), such that only one extent remains in each of the smaller rectangles. Rule 3 is detailed in Table 6.1.

Consider again the rectangles shown in FIGS. 87 through 89. The rectangle B_(Y),1.sup.(6) is common with B_(Z),2.sup.(5) and contains the two extents ⁵ F₇ and ⁵ F₄. Rule 3 is used to split this rectangle into two smaller rectangles such that ⁵ F₄ is in one of them and ⁵ F₇ in the other. The values of the width of the new rectangles B_(Y),1.sup.(6,1) and B_(Y),1.sup.(6,2) are then set to Y_(o),4 and Y_(d) -Y_(o),4, respectively.

Each rectangle B_(e)ζ.sup.(i), or each smaller rectangle B_(e)ζ.sup.(j,m), represents one face of a GV. The greatest volumes and their dimensions for the example part of FIG. 80 are shown in FIG. 90. The depths of each extent in each greatest volume are further examined to determine whether or not they extend outside the greatest volume and into an adjacent one. For example, a profile on the XZ face will have its Y dimension evaluated to determine whether or not it extends beyond the greatest volume. If it does, that portion of the extent is included as a part of the adjacent greatest volume. In this manner, the total number of GVs, N_(GV), are determined, and each GV contains N_(E),GV number of extents on its six surfaces. It is possible that some of GVs may not contain any extents. For example, (GV)₈ does not contain an extent on any of its surfaces.

The algorithm for determining the GVs is based on the sorting of the extents, determining the boundaries of the bands and the rectangles and finally determining the GVs from the rectangles. The sorting algorithm takes the N extents on a part and stores these extents in the three lists L.sub.ρ, ρ=XYZ, such that each L.sub.ρ contains K.sub.ρ extents that lie on faces in the corresponding set {n.sub.ρ }. The lists L.sub.ρ are then sorted using the distance ρ_(e),α.sbsb.k as the sorting criterion. The sorting algorithm takes the K.sub.ρ extents from each list L.sub.ρ and identifies the extent ^(n).sbsp.e.sbsp.k F.sub.α.sbsb.k.sup.(k) that has the maximum value of the distance ρ_(e),α.sbsb.k. It then moves ^(n).sbsp.e.sbsp.k F.sub.α.sbsb.k.sup.(K) to the last position K.sub.ρ in the list L.sub.ρ. The algorithm then takes the K.sub.ρ -1 extents, identifies the extent ^(n).sbsp.e.sbsp.k F.sub.α.sbsb.k-1.sup.(K-1) that has the maximum value of ρ_(o),α.sbsb.k, and moves it to the K.sub.ρ -1 position. This procedure continues until the entire list is arranged such that ρ_(e),α.sbsb.k+1 >ρ_(e),α.sbsb.k, k=1, . . . ,K.sub.ρ -1.

The arrays L.sub.ρ, ρ=X, Y, Z, are then used to determine the boundaries of the bands B.sub.ρζ, ρ=X,Y,Z and ζ=1, . . . ,N_(B),ρ, where N_(B),ρ is the maximum number of bands B.sub.ρζ in the direction ρ. The algorithm takes an extent ^(n).spsb.e.spsb.i F.sub.α.sbsb.i.sup.(i) from the sorted array L.sub.ρ and retrieves the corresponding value of the distance ρ_(e),α.sbsb.i. The value ρ_(e),α.sbsb.i is then compared with the value of each of the distances ρ_(o),α.sbsb.k of the extents ^(n).spsb.e.spsb.k F.sub.α.sbsb.k.sup.(k), k=i+1, . . .K.sub.ρ. The bands are identified in the ρ-direction using Rule 1 or Rule 2. Rule 1 is used when ρ_(e),α.sbsb.i <ρ_(o),α.sbsb.k, otherwise Rule 2 applies. This process is repeated until the boundaries of the bands in each direction ρ are determined. The number of extents N_(E),ζ in each band B.sub.ρζ is determined by incrementing N_(E),ζ by one whenever an extent is included in the band B.sub.ρζ.

The algorithm then determines the rectangles B_(e),ζ.sup.(i), j=1, . . . ,M.sub.ρζ, where M.sub.ρζ is the number of rectangles in B.sub.ρζ, such that each band B.sub.ρζ is given by equation (6.4). This is done by taking a band from the set B.sub.ρζ, ρ=X,Y,Z and ζ=1, . . . ,N_(B),ρ and retrieving a set of corresponding orthogonal bands. The intersection of the edges of the band B.sub.ρζ with each of the orthogonal bands then form a rectangle B_(e)ζ.sup.(j). In this manner the M.sub.ρζ rectangles are determined in each band B.sub.ρζ using equation (6.5). The number of extents in each rectangle B.sub.ρζ.sup.(j) that is, N.sub.ρζ.sup.(j) is then found by determining whether or not the distance to the neareset boundary of each extent ^(n).spsb.e.spsb.k F.sub.α.sbsb.k.sup.(k) from the ρ-axis is greater than the distance to the nearest orthogonal edge and is smaller than the the distance to the farthest orthogonal edge of the rectangle. If it is, then the extent ^(n).spsb.e.spsb.k F.sub.α.sbsb.k.sup.(k) is included in the rectangle B_(e)ζ.sup.(j) and N_(e)ζ.sup.(j) is incremented by one. If it is not, then the next extent is taken and the same procedure is repeated until all the extents have been examined. All the rectangles for which N_(e)ζ.sup.(j) >1 are then split into smaller rectangles B_(e)ζ.sup.(j,m), m=1, . . . ,N_(e)ζ.sup.(j). The width of each smaller rectangle is then set so that only one extent is included in each of them.

The greatest volumes (GV)_(l) are formed using the rectangles B_(X)ζ.sup.(j), j=1, . . . ,M_(X),ζ and the smaller rectangles B_(X),ζ.sup.(j,m), m=1, . . . ,N_(X),ζ.sup.(j) that exist in the set of X-bands B_(X),ζ, ζ=1,. . . , N_(B),X. The rectangles within the bands B_(X),ζ determine the X- and Y-dimensions of GV_(l). The Z-depth of each GV_(l) is then equal to the width of the Z-band B_(Z),1. The next group of GVs that is stacked under these GVs have the same X- and Y-dimensions, however the Z-depth equals the width of the next Z-band, that is, B_(Z),2. This procedure is continued until all Z-bands B_(Z),ζ, ζ=1, . . . , N_(B),Z are considered. In this manner the total number of GVs, N_(GV), are determined.

Once the location and size of each GV is determined, the extents that lie within it are found. An extent ^(n) F.sub.α.sbsb.k that exists either in the pair B_(X)ζ1 and B_(Y)ζ2 in the pair B_(Y)ζ2 and B_(Z)ζ3 or in the pair B_(X)ζ1 and B_(Z)ζ3 is included in (GV)_(l). This is done by taking an extent ^(n) F.sub.α.sbsb.k from the band B_(X)ζ1 and determining whether or not ^(n) F.sub.α.sbsb.k exists within B_(Y)ζ2 or B_(Z)ζ3. If it does, then it is included in (GV)_(l), otherwise another extent is taken from B_(X)ζ1 and evaluated in the same manner. This process is repeated until all the extents in the band B_(X)ζ1 are considered. The algorithm then takes another extent ^(n) F.sub.α.sbsb.k from the band B_(Y)ζ2 and determines whether or not it exists within the band B_(Z)ζ3. If it does, the extent ^(n) F.sub.α.sbsb.k is included in (GV)_(l), otherwise the next extent is examined in the same manner. This process continues until all the extents in the band B_(Y)ζ2 are considered.

It is possible that the extent ^(n) F.sub.α.sbsb.2, may also extend into an adjacent GV. All extents that reside within a GV are evaluated to determine whether or not they extend beyond the GV. If the Z-dimension of the extent ^(n) F.sub.α.sbsb.k (for n=1 or 6) is greater than the Z-dimension of the GV, then all of ^(n) F.sub.α.sbsb.k is included in the GV_(l) and the portion extending beyond it is included in the adjacent GV, say GV_(l)ρ, ρ=X for n=3 or 5; ρ=Y for n=2 or 4; and ρ=Z for n=1 or 6. In a similar manner extent ^(n) F.sub.α.sbsb.k is again evaluated to determine whether or not it is entirely contained within GV_(l)ρ and the process is continued. Similarly, the extents on faces n=2 or 4 and faces n=3 or 5 are evaluated to determine whether or not they extend beyond the GV in Y-dimension and X-dimension, respectively.

The previous discussion provided the details of representing the machinable profiles by FMEMs. The methods for determining the intersections of the profiles of the FMEMs on a common surface and intersections of the profile shells from two orthogonal surfaces were also described. The results of the program are presented below.

Consider the four profiles shown in FIGS. 91 through 94. These four profiles and their combination will be used as shown in FIG. 95 to illustrate that the intersection routines developed above. The first column of FIG. 95 shows the four profiles that are used to generate the combinations A through D. The four profiles are a circle, a rectangle with rounded corners, a triangle with rounded corners and an ellipse. Thus, combination A for a circle describes the intersection of two identical circular holes, whereas combination C for a rectangle illustrates the intersection of three identical rectangular pockets. Combination D includes the intersection of a thin rectangle that divides the island formed by the four intersecting profiles shown in combination C. The last row of FIG. 95 includes only two combinations: combination C, which uses one profile from each of the previous four profiles, and combination D, which includes the additional intersection of a narrow rectangle with the island formed by the intersecting profiles and with the boundary resulting from the four intersecting profiles.

Each of the eighteen combinations shown in FIG. 95 are used to verify the method employed to determine the multi-profile intersection on a common surface. These various combinations were given as input to the program. The results are shown in FIGS. 96 through 114.

FIGS. 96 through 99 show the results of the intersections of circles for the combinations A, B, C, and D, respectively. The intersection of two circles is given by combination C₅ above. In this case, the two intersection points segment the circles into four circular arcs. One of the arc segments of each circle is removed such that the resultant profile is given by equation (4.19), which is shown in FIG. 96.

FIG. 97 shows the intersection of three circles that results in six intersection points. This intersection results in the intersection points R₁ through R₆ of the intersecting circles ₁ ^(n) g_(k), ₂ ^(n) g_(k), and ₃ ^(n) g_(k) and is shown in FIG. 100. The intersection of circle ₁ ^(n) g_(k) with ₂ ^(n) g_(k) yields points R₁ and R₂. The pairs of the points R₃ and R₄, and R₅ and R₆ result from the intersections of ₁ ^(n) g_(k) with ₃ ^(n) g_(k) and ₂ ^(n) g_(k) with ₂ ^(n) g_(k), respectively. The intersection points R₁, R₂, R₃ and R4 lie on the circle ₁ ^(n) g_(k). The points R₁, R₂, R₅ and R₆, and R₃, R₄, R₅ and R₆ lie on the circles ₂ ^(n) g_(k) and ₃ ^(n) g_(k), respectively. Each of the three circles is partitioned into five segments. However, only the even segments of each circle remains after the intersection, since the starting points of each circle is within the cavity. The algorithm for segmenting the circular arcs was discussed above. The governing equation for the resultant profile is given by equation 4.13(b), and is shown in FIG. 97.

FIG. 98 shows the intersection of four circles. In this case, an island results within the resultant cavity. The island is comprised of the segments of the circles that remain after the intersection. This combination verifies the procedure presented above. FIG. 99 shows an example of the intersection of a narrow slot with the island resulting from the intersection of these four circles and with the boundary resulting from the four intersecting circles.

FIGS. 101 through 104 show the results of the intersections of the combinations A to D for the rectangular profile, respectively. The intersection of two rectangles shown in FIG. 101 has been denoted combination C₁ and was discussed above. The procedure used to determine whether or not the end points are inside the intersecting profile was also discussed above. It is shown in FIG. 101 that one of the four fillet curves of each rectangle has both end points within the intersecting profile; therefore, the two curves are removed. FIG. 102 shows the resultant profile due to the intersections of three rectangles. As shown in FIG. 103, an island is created in the middle of a cavity when these four rectangular pockets intersect. FIG. 104 shows a narrow slot passing through the island.

FIGS. 105 through 108 show the results of the intersections of the combinations A to D for a triangular profile, respectively. The intersections of two triangles has been denoted the combinations C₁ and C₂ above. FIG. 106 shows the resultant profile from the intersections of three triangles. When four triangular pockets intersect, an island is created in the middle of the cavity. This is shown in FIG. 107. FIG. 108 shows a narrow slot passing through the island and intersecting with the boundary formed by the four triangles.

FIG. 109 through 112 show the results of the intersections of the combinations A to D for elliptical profiles. The intersection of two ellipses is shown in FIG. 109, and has been denoted the combination C₆ above. FIG. 110 shows the resultant profile from the intersections of three ellipses. When four elliptical pockets intersect as indicated, an island is created in the middle of the cavity. This is shown in FIG. 111. FIG. 112 shows a narrow slot passing through the island and intersecting with the boundary formed by the four ellipses.

The result of the intersection of the mixed profile is shown in FIG. 113. The set of intersecting profiles illustrates the combinations noted C₁ through C₄. The C₁, C₂ and C₃ combinations are for an edge of the rectangle intersecting an edge of the triangle, a fillet curve of another rectangle, and a circle, respectively. The combination C₄ is created by the intersection of a circle with an ellipse. FIG. 113 also shows that an island is created in the middle of a cavity when these four profiles intersect. A narrow slot is then is then created on the island as shown in FIG. 114.

FIG. 115 shows the combinations of orthogonally intersecting similar profile shells that are used to verify the orthogonal intersection of FMEMs. Each of the three combinations contains the same type of profile, one place on each of two orthogonal faces. Pair A consists of two identical orthogonally intersecting identical profile shells such that their axes intersect. Pair B contains two orthogogonally intersecting profile shells of the same shape such that their axes intersect, but the two profiles are of different sizes. Pair C contains two orthogonally intersecting profile shells of the same shape but different sizes such that their axes do not intersect. The first column of FIG. 115 defines the three profiles used. The next three columns of FIG. 115 define the pairs A to C for a circular, rectangular, and elliptical profile shells, respectively.

FIG. 116 shows the combinations of orthogonally intersecting dissimilar profile shells that are used to verify further the orthogonal intersection of FMEMs. Pair A consists of two orthogonally intersecting dissimilar profile shells of "same" size and such that their axes intersect. Pair B consists of two orthogonally intersecting dissimilar profile shells of different size and such that their axes intersect. Pair C consists of two orthogonally intersecting dissimilar profile shells of different sizes and such that their axes do not intersect. The first column of FIG. 116 defines one of the two profiles for the pairs A to C The next three columns of FIG. 116 define the combinations A to C for circular, rectangular, and elliptical shells orthogonally intersecting rectangular, elliptical and circular profile shells, respectively.

Each of the eighteen combinations shown in FIGS. 115 and 116 is used toverify the orthogonal profile intersection algorithm. These combinations were given as input to the program. The results are shown in FIGS. 117 through 134.

FIGS. 117 through 119 show the spatial curves resulting from the orthogonal intersections of circular profile shells for combinations A, B, and C, respectively. The orthogonal intersection of two circular shells is denoted combination II₅. The intersection curve is a pair of orthogonal planar ellipses given by equation (5.34). Each of the two cylindrical surfaces are then dissected into the patches given by equation (5.23). FIG. 118 shows the spatial intersection curve of circular shells for combination B. FIG. 119 shows the intersection of the circular profile shells for combination C.

FIGS. 120 through 122 show the results of the orthogonal intersections of the rectangular profile shells for combination A, B, and C, respectively. The orthogonal intersection of two rectangular shells is denoted combination II₁. Each plane of the rectangular shell intersects with one of the four planes of another rectangular shell and yields in a straight line given by equation (5.5). FIG. 121 shows the results of the intersection of two rectangular profile shells for combination B. The smaller rectangular shell fully intersects two of the four planes of the larger shell. The intersection curves, in this case, match the profile of the smaller rectangular profile shell. Each of the intersected planes of the two shells is dissected into patches given by equation (5.12). FIG. 122 shows the spatial curve resulting from the orthogonal intersection of the rectangular shells for combination C. Out of the three intersecting planes of the smaller rectangular shell, only one plane fully intersects the other, and the other intersect partially.

FIGS. 123 through 125 show the results of the orthogonal intersections of the elliptical profile shells for combinations A, B, and C, respectively. The orthogonal intersection of two elliptical shells is denoted combination II₆. The spatial intersection curve is a fourth order curve given by equation (5.37). FIG. 124 shows the results of the orthogonal intersection of the elliptical profile shells for combination B. The smaller elliptical shell fully intersects the larger shell. The spatial intersection curve in this case is also given by equation (5.37). Each of the intersected elliptical shell surfaces is then dissected into patches given by equation (5.18). FIG. 125 shows the spatial curve resulting from the intersection of the elliptical profile shells for combination C.

FIGS. 126 through 128 show the spatial curves resulting from the orthogonal intersections of the circular profile shells and the rectangular profile shells for combinations A, B, and C, respectively. The orthogonal intersection of a circular shell with a plane is denoted combination II₃. The spatial intersection curves consist of a collection of circular arcs given by equation (5.15). Each of the dissected cylindrical surfaces is then given by equation (5.23). FIG. 127 shows the intersection of circular profile shells and rectangular profile shells for combination B. FIG. 128 shows the spatial curves resulting from the intersection of the circular profile shells and the rectangular profile shells for combination C.

FIGS. 129 through 131 show the spatial curves resulting from the intersection of the rectangular profile shells and the elliptical profile shells for combinations A, B, and C, respectively. The orthogonal intersection of a plane with an elliptical shell is denoted combination II₂. The intersection curves consist of a collection of quadratic curves given by equation (5.15). Each of the dissected elliptical surfaces is then given by equation (5.18). FIG. 130 shows spatial curve resulting from the intersection of rectangular profile shell and the elliptical profile shells for combination B. FIG. 131 shows the spatial curve resulting from the intersection of the rectangular profile shell and the elliptical profile shells for combination C.

FIGS. 132 through 134 show the spatial curves resulting from the intersections of the elliptical profile shells and the circular profile shells for combinations A, B, and C, respectively. The orthogonal intersection of a cylindrical profile shell with an elliptical profile shell is denoted combination II₄. The resulting spatial intersection curve is given by equation (5.28). FIG. 133 shows the spatial curve resulting from the intersection of the elliptical profile shell and the circular profile shells for combination B. FIG. 134 shows the spatial curve resulting from the intersection of the elliptical profile shell and the circular profile shells for combination C.

FIG. 135 shows the profiles of FMEMs of various shapes that are used to verify the overall algorithm. These FMEMs are applied on four of the six faces of a stock block. Three rectangular pocket FMEMs, a left pocket, a right pocket and a horizontal pocket are applied on the front face of the block. The horizontal procket intersects the left pocket, but has a shallower depth. The left side face and the back face of the block has applied a triangular profile FMEM and an elliptical profile FMEM, respectively. The top face of the block has three FMEMs, a narrow rectangular pocket, a gasket-shaped cavity profile with an island within it, and a circular profile on the island of the gasket-shaped cavity.

Each of the seven profiles shown in FIG. 135 was given as input to the program. The resultanat geometry determined by the program is shown in FIG. 136. The 2D algorithm determined the intersections of the left and the horizontal pockets on the front face of the part and the intersections of hole and the island on the top face. The triangular profile of the left side face orthogonally intersects the narrow pocket and the gasket-shaped cavity profiles of the top face. The triangular profile also intersects the left and horizontal pockets of the front face. The right pocket of the front face orthogonally intersects the gasket cavity and its island, and then intersects the circular profile on the island. The elliptical profile of the back face orthogonally intersects the three cylindrical surfaces of the gasket-shaped cavity. The program determines the intersections on the common planes and on orthogonal planes of the part. The final part geometry is then displayed as shown in FIG. 136.

The successful development of a parametric solid modeler for milling represents a radical departure from the methods currently being used to generate a part model for milling, or any other manufacturing process. The essence of the modeler's philosphy is "what you machine results in what you get" (WYMRIWYG). The modeler permits the user to very easily generate over 125 unique cavity profiles and about the same number of island profiles, all of which are represented by the same data structure. These profiles include circular and elliptical holes, slots, triangular and rectangular pockets, "gaskets", and many others. In addition, each of cavity can contain an island, whose profile and orientation are independent of the cavity's profile.

The results presented above clearly illustrated the system's powerful algorithms that can determine the profiles resulting from the intersections of two or more profiles on a common surface and the spatial curves resulting from the complete or partial intersections of two orthogonal profile shells. It was also shown above that very complicated 3-D shapes can be easily created with this new system, and that the order in which the FMEMs are applied is not a factor. This latter feature is a significant improvement over the capabilities of existing solid modelers.

This work resulted in a modeling tool that

employs a primitive for solid modeling, called a fundamental manufacturing entity for milling (FMEM), that is based on the machining process itself,

mimics real world milling operations and allows the immediate display of the part's shape,

stores the results of each machining operation in a single, uniform and compact database,

allows the application of the machining operations in any order,

stores machining information as an integral part of the geometric model, thereby creating a straight forward link between CAD and CAM,

can easily create complex 2D profiles and the intersection of any combination of them on any of the six faces of the part,

cavity and island profiles can be created independent of one another,

employs a sophisticated algorithm that automatically divides the part into greatest volumes (GVs) and then determines the intersections of the profiles of the FMEMs on its orthogonal faces irrespective of the order in which they were generated,

provides a means bywhich an inexhaustive list of FMEMs can be created, stored and used repeatedly on any surface of any part,

determines the intersections of complex shell profiles on any two orthogonal faces,

saves the information about the volume of the material removed after each milling operation rather than the material remaining, which should make the generation of process plans straight forward,

can transfer the resulting geometric shape to automatic mesh generation routines used by finite element programs, since the exact surface representation is available.

can use the FMEM and GV data structure to determine interference of an assembly of machined parts. 

I claim:
 1. A graphic display system to provide a graphically represented solid modeler for simulating a material removal process in a computer aided machining environment, said graphic display system comprising:at least one fundamental manufacturing entity representing a three dimensional object; profile generation means for generating at least one machine profile representing a volume of material to be removed from said at least one fundamental manufacturing entity, said machine profile is selectively defined on at least one surface of said at least one fundamental manufacturing entity by an ordered combination of edges defined by a first circular arc connected in series at a first point to a first guadric curve connected in series at a second point to a second circular arc connected in series at a third point to a straight edge connected in series at a fourth point to a third circular arc, wherein parameters defining a shape and the existence of each of said first circular arc, said first guadric curve, said second circular arc, said straight edge, and said third circular arc of said ordered combination are manipulated to define said machine profile.
 2. The graphic display system of claim 1, further comprising storage means for storing matrix information representing said machme profile as an integral part of said solid modeler.
 3. The graphic display system of claim 1, further comprising validation means for validating said ordered combination against a predetermined set of rules describing acceptable combinations of edges and surfaces representing valid machine profiles suitable for real world machining operations such that said volume to be removed from said at least one fundamental manufacturing entity is substantially identical to a real life volume produced by an actual machining operation.
 4. The graphic display system of claim 1, wherein said machine profile defines at least one island such that the total perimeter of said at least one island is defined by said ordered combination of edges and surfaces.
 5. The graphic display system of claim 1, wherein said ordered combination is defined by a plurality of straight edges, each of said plurality of straight edges being connected by a curve to thereby define a closed perimeter, and wherein a grouping of arcs are disposed on an intermediate portion of each of said plurality of straight edge to define a rounded hump on each of said straight edges,and wherein said ordered combination is manipulated to define said machine profile.
 6. The graphic display system of claim 1, futher comprising storage means for electronically storing complete analytical specifications of said machine profile.
 7. The graphic display system of claim 1, further comprising conversion means for converting individual machining operations generated by said profile generation means into an NC code to perform an actual machining operation.
 8. The graphic display system of claim 1, further comprising intersection calculation means for determining a numerical representation of an intersection of at least two machine profiles.
 9. The graphic display system of claim 8, wherein said intersection calculation means detenes said numerical representation automatically.
 10. The graphic display system of claim 8, wherein said machine profiles intersect each other on a common surface.
 11. The graphic display system of claim 8, wherein said machine profiles intersect each other on two orthogonal surfaces.
 12. The graphic display system of claim 8, further comprising consolidation means for consolidating a plurality of intersecting machine profiles into a single machine profile.
 13. The graphic display system of claim 1, wherein said system compnses a plurality of fundamental manufacturing entities each representing a three dimensional object, and wherein each of said at least one fundamental manufacturing entities represent a separate machiing operation.
 14. The graphic display syssm of claim 1, wherein said ordered combination is defined by the following set of mathematical equations; ##EQU52## where ##EQU53## also where ##EQU54## and where ##EQU55##
 15. A graphic display system to provide a graphically represented solid modeler for simulating a material removal process in a computer aided machining environment, said graphic display system comprising: at least one fundamental manufacturing entity representing a three dimensional object;profile generation means for generating at least one machine profile representing a volume of material to be removed from said at least one fundamental manufacturing entity, said machine profile is selectively defined on at least one surface of said at least one fundamental manufacturing entity by an ordered combination of edges and surfaces, wherein a shape of said ordered combination is manipulated to define said machine profile, wherein one of an inner and outer profile of a cavity formed on any surface of said fundamental manufacturing entity is defined by an ordering of four edges, twelve circular arcs, and four quadric curves, and the vertices that bound each of the curves.
 16. A graphic input method for creating a three dimensional solid modeler for simulating a material removal process in a computer aided machining environment whereby machinable profile information may be stored as an integral part of said solid modeler, said method comprising the steps of:choosing a stock element representing a three dimensional object from which said solid modeler wil be defined, said object comprising stock surfaces and stock edges for defining dimensions of said stock element; defining at least one machine profile representing a volume to be machined, said at least one machine profile comprising profile surfaces and profile edges defining at least one dimension of said volume, wherein said profile edges are defined by an ordered combination of edges; dividing said stock element into a minimum number of generalized basic volumes, said generalized basic volumes adapted to interface with said at least one machine profile, wherein said step of dividing said stock element comprises the steps of: choosing a first stock surface of said stock element; surrounding each profile edge located on said first stock surface with an extent having a mininum perimeter; sorting said extents as defined by said surrounding step in a list based on size in a descending order; selecting one of said extents from said list; expanding said one of said extents until said one intersects with either a stock edges or another of said extents; repeating said choosing, surrounding, sorting, selecting and expanding steps for each stock surface of said stock element; validating said at least one machine profile against a predetermined set of rules describing acceptable combinations of edges; locating said at least one machine profile on said stock element.
 17. The graphical input method according to claim 16, further comprising a step of dividing said stoc element into a minimum number of generalized basic volumes, said generalized basic volumes adapted to interface with said at least one machin profile.
 18. The graphical input method according to claim 17, wherein said step of dividing said stock element comprises the steps of:choosing a first stock surface of said stock element; surrounding each profile edge located on said first stock surface with an extent having a minimum perimeter.
 19. The graphical input method according to claim 18, further comprising the steps of:sorting said extents as defined by said surrounding step in a list based on size in a descending order; selecting one of said extents from said list; expanding sad one of said extents until said one intersects with either a stock edges or another of said extents; repeating said choosing, surrounding, sorting, selecting and expanding steps for each stock surface of said stock element.
 20. The graphical input method according to claim 19, further comprising the steps of:choosing an expanded extent on said first stock surface; translating said expanded extent in a direction normal to said first stock surface, said moving step defining a plurality of surfaces of a geeneralized basic volume.
 21. The graphical input method according to claim 16, wherein said step of defining at least one machine profile comprises manipulating a standrdized profile for defining said profile edges, said standardized profile comprising a predetermined pluralty of edges, whose shape is altered to define said machine profile.
 22. The graphical input method according to claim 21, wherein said standardized profile futher comprises a depth adapted to define said profile surfaces.
 23. The graphical input method according to claim 16, further comprising the step of displaying said minimum number of generalized basic volumes on a computerized display means.
 24. The graphical input method according to claim 16, further comprising the step of determining an intersection edge within said stock element.
 25. The graphical input method according to claim 16, further comprising the step of calculating a numerical representation of an intersection of at least two machine profiles.
 26. The graphical input method according to claim 25, wherein said step of calculating a numerical representation includes determining said numerical representatimn automatically.
 27. The graphical input method according to claim 25, wherein said machine profiles intersect each other on a common surface.
 28. The graphical input method according to claim 25, wherein said machine profiles intersect each other on orthogonal surfaces.
 29. The graphical input method according to claim 25, furter comprising the step of creating a new machine profile representing a combination of said at least two machine profiles that intersect.
 30. The graphical input method according to claim 16, wherein said step of defining at least one machine profile comprises manipulating a standardized profile for defining said profile edges, said standardized pofile being defined by the following set of mathematical equations; ##EQU56## where, ##EQU57## also where, ##EQU58## and where ##EQU59##
 31. A graphic input method for creating a three dimensional solid modeler for simulating a modeling process in a computer aided modeling environment, said method comprising the steps of: choosing a stock element representing a bounded object from which said solid modeler will be defined, said stock element comprising stock surfaces and stock edges defining at least one dimension of said stock element;defining at least one model profile representing a region to be modeled, said at least one model profile comprising profile surfaces and profile edges defining dimensions of said model profile, wherein a standardized model profile defines said profile edges, and wherein said profile surfaces defines a volume of said at least one machine profile; locating said at least one model profile on said stock element, wherein said standardized model profile is defined by an ordered combination defined by a first circular arc connected in series at a first point to a first guadric curve connected in series at a second point to a second circular arc connected in series at a third point to a straight edge connected in series at a fourth point to a third circular arc, wherein parameters defining a shape and the existence of each of said first circular arc, said first guadric curve, said second circular arc, said straight edge, and said third circular arc of said ordered combination are manipulated to define said machine profile.
 32. The method according to claim 31, further comprising a step of validating said at least one model profile against a predetermined set of rules defining acceptable model profiles.
 33. The method according to claim 32, wherein said standardized machine profile is defined by the following mathemacal equations; ##EQU60## where, ##EQU61## also where, ##EQU62## and where ##EQU63##
 34. The method according to claim 31, wherein said standardized model profile is defined by an ordered combination of a plurality of straight edges, each of said plurality of straight edges being connected by a curve to thereby define a closed perimeter, and wherein a grouping of arcs are disposed on an intermediate portion of each of said plurality of straight edge to define a rounded hump on each of said straight edges, and wherein said ordered combination is manipulated to define said model profile.
 35. The method according to claim 31, wherein said model profile defines a part to be created by injection molding.
 36. The method according to claim 31, wherein said model profile defines a part to be created by powder metallurgy.
 37. The method according to claim 31, wherein said model profile defines a part to be created by casting.
 38. The method according to claim 31, wherein said model profile defines a part to be created by milling.
 39. The method according to claim 31, further comprising the step of storing matrix information describing said model profile, said matrix information being stored as an integral part of said solid modeler.
 40. The method according to claim 31, further comprising the step of converting individual machining operations defined by said model profile into an NC code. 